Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs., , and . CCC, page 74-80. IEEE Computer Society, (2009)A New Point of NP-Hardness for 2-to-1 Label Cover., , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 1-12. Springer, (2012)Tensor Network Complexity of Multilinear Maps., , and . ITCS, volume 124 of LIPIcs, page 7:1-7:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the usefulness of predicates., and . TOCT, 5 (1): 1:1-1:24 (2013)A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem., and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 474-485. Springer, (2011)Conditional Inapproximability and Limited Independence.. KTH Royal Institute of Technology, Sweden, (2008)Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection., , and . SODA, page 277-294. SIAM, (2013)Balanced max 2-sat might not be the hardest.. STOC, page 189-197. ACM, (2007)New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover., , , and . TOCT, 6 (1): 2:1-2:20 (2014)Inapproximability of NP-Complete Variants of Nash Equilibrium., , and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 13-25. Springer, (2011)