Author of the publication

Improved NP-Inapproximability for 2-Variable Linear Equations.

, , , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 341-360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

 

Other publications of authors with the same name

Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering., , and . ICALP, volume 107 of LIPIcs, page 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Geometry-Biased Transformer for Robust Multi-View 3D Human Pose Reconstruction., , and . CoRR, (2023)A Dichotomy for Real Weighted Holant Problems., and . Comput. Complex., 25 (1): 255-304 (2016)Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits., , , and . SODA, page 2326-2341. SIAM, (2017)Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits., , , and . Theory of Computing, 14 (1): 1-29 (2018)Improved NP-Inapproximability for 2-Variable Linear Equations., , , , and . Theory of Computing, 13 (1): 1-51 (2017)Approximation resistance on satisfiable instances for predicates with few accepting inputs.. STOC, page 457-466. ACM, (2013)From Holant to #CSP and Back: Dichotomy for Holant c Problems., , and . Algorithmica, 64 (3): 511-533 (2012)Better Prior Knowledge Improves Human-Pose-Based Extrinsic Camera Calibration., , and . ICPR, page 4758-4765. IEEE, (2020)Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness.. KTH Royal Institute of Technology, Sweden, (2015)