( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems.

, , и . 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.

Joseph Wenner

Andreas Wenner

Christian Wenner

Hilke Wenner

Heinz Wenner

 

Другие публикации лиц с тем же именем

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