( en | de | ru )

 

Disambiguation of "Nordh, Gustav"

Author of the publication

copydeleteadd this publication to your clipboard
Constructing NP-intermediate problems by blowing holes with parameters of various properties.

, , and . Theor. Comput. Sci., (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.

Bernd Nordhausen

Hans Nordheimer

Werner Nordhoff

André Nordhues

Christina Nordhammer

 

Other publications of authors with the same name

Approximability of Integer Programming with Generalised Constraints., , and . CP, volume 4204 of Lecture Notes in Computer Science, page 256-270. Springer, (2006)Introduction to the Maximum SolutionProblem., and . Complexity of Constraints, volume 5250 of Lecture Notes in Computer Science, page 255-282. Springer, (2008)Constructing NP-intermediate problems by blowing holes with parameters of various properties., , and . Theor. Comput. Sci., (2015)The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups., and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 370-379. Springer, (2004)Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction., , and . CP, volume 8124 of Lecture Notes in Computer Science, page 398-414. Springer, (2013)A Trichotomy in the Complexity of Propositional Circumscription.. LPAR, volume 3452 of Lecture Notes in Computer Science, page 257-269. Springer, (2004)Perfect Skolem sets.. Discret. Math., 308 (9): 1653-1664 (2008)Trichotomies in the Complexity of Minimal Inference., , and . Theory Comput. Syst., 50 (3): 446-491 (2012)Approximability of Clausal Constraints., and . Theory Comput. Syst., 46 (2): 370-395 (2010)The Maximum Solution Problem on Graphs., , and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 228-239. Springer, (2007)