( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Trichotomies in the Complexity of Minimal Inference.

, , и . Theory Comput. Syst., 50 (3): 446-491 (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.

Christina Nordhammer

Carolin Nordhoff

André Nordhues

Werner Nordhoff

Hans Wilhelm Nordheider

 

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

Approximability of Integer Programming with Generalised Constraints., , и . CP, том 4204 из Lecture Notes in Computer Science, стр. 256-270. Springer, (2006)Introduction to the Maximum SolutionProblem., и . Complexity of Constraints, том 5250 из Lecture Notes in Computer Science, стр. 255-282. Springer, (2008)Constructing NP-intermediate problems by blowing holes with parameters of various properties., , и . Theor. Comput. Sci., (2015)A Trichotomy in the Complexity of Propositional Circumscription.. LPAR, том 3452 из Lecture Notes in Computer Science, стр. 257-269. Springer, (2004)Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction., , и . CP, том 8124 из Lecture Notes in Computer Science, стр. 398-414. Springer, (2013)The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups., и . COCOON, том 3106 из Lecture Notes in Computer Science, стр. 370-379. Springer, (2004)Perfect Skolem sets.. Discret. Math., 308 (9): 1653-1664 (2008)Trichotomies in the Complexity of Minimal Inference., , и . Theory Comput. Syst., 50 (3): 446-491 (2012)The Maximum Solution Problem on Graphs., , и . MFCS, том 4708 из Lecture Notes in Computer Science, стр. 228-239. Springer, (2007)On the Strength of Uniqueness Quantification in Primitive Positive Formulas., и . MFCS, том 138 из LIPIcs, стр. 36:1-36:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)