( en | de | ru )

 

Disambiguation of "Austrin, Per"

Author of the publication

copydeleteadd this publication to your clipboard
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems.

, , and . Theory of Computing, (2015)

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.

Per Zemke

Per Segebrecht

Per Davidsson

Per Stickforth

Per Nerdinger

 

Other publications of authors with the same name

Approximation Resistant Predicates from Pairwise Independence., and . Comput. Complex., 18 (2): 249-271 (2009)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)A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem, and . CoRR, (2010)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)Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas., and . Electron. Colloquium Comput. Complex., (2021)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)Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems, , and . CoRR, (2011)Balanced max 2-sat might not be the hardest.. STOC, page 189-197. ACM, (2007)