I agree that this site is using cookies. You can find further informations here.
X
Merkliste 
 1 Ergebnisse 
 
1

Optimal inapproximability with universal factor graphs:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Austrin, Per ; Brown-Cohen, Jonah ; Håstad, Johan - p. 434-453 , 2021
Link: https://dl.acm.org/doi/10.5555/3458064.3458091