( en | de | ru )

 

Disambiguation of "Wenner, Cenny"

Author of the publication

copydeleteadd this publication to your clipboard
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four.

. Electron. Colloquium Comput. Complex., (2012)

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.

Andreas Wenner

Joseph Wenner

Christian Wenner

Hilke Wenner

Heinz Wenner

 

Other publications of authors with the same name

Complexity of Canadian Traveler Problem Variants, , , and . CoRR, (2012)Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four.. Theory of Computing, (2013)Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract).. APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 325-337. Springer, (2012)Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction.. Stockholm University, Sweden, (2014)Rule-based Logical Forms Extraction.. NODALIDA, page 402-409. University of Tartu, Estonia, (2007)Parity is Positively Useless.. APPROX-RANDOM, volume 28 of LIPIcs, page 433-448. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems., , and . APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 26-41. Springer, (2013)On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems., , and . Theory of Computing, (2015)Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four.. Electron. Colloquium Comput. Complex., (2012)Complexity of Canadian traveler problem variants., , , and . Theor. Comput. Sci., (2013)