Gustav Nordh

发表

On the Strength of Uniqueness Quantification in Primitive Positive Formulas

Gustav Nordh, Victor Lagerkvist, 2019, MFCS.

Integer programming with 2-variable equations and 1-variable inequalities

Gustav Nordh, Manuel Bodirsky, Timo von Oertzen, 2009, Inf. Process. Lett..

Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction

Gustav Nordh, Peter Jonsson, Victor Lagerkvist, 2013, CP.

Approximability of Integer Programming with Generalised Constraints

Gustav Nordh, Peter Jonsson, Fredrik Kuivinen, 2006, CP.

Propositional Abduction is Almost Always Hard

Gustav Nordh, Bruno Zanuttini, Gustav Nordh, 2005, IJCAI.

Introduction to the Maximum SolutionProblem

Gustav Nordh, Peter Jonsson, P. Jonsson, 2008, Complexity of Constraints.

The Maximum Solution Problem on Graphs

Gustav Nordh, Peter Jonsson, Johan Thapper, 2007, MFCS.

Trichotomies in the Complexity of Minimal Inference

Gustav Nordh, Arnaud Durand, Miki Hermann, 2012, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups

Gustav Nordh, 2004, MFCS.

Generalised Integer Programming Based on Logically Defined Relations

Gustav Nordh, Peter Jonsson, P. Jonsson, 2006, MFCS.

MAX ONES Generalized to Larger Domains

Gustav Nordh, Peter Jonsson, Fredrik Kuivinen, 2008, SIAM J. Comput..

Perfect Skolem sets

Gustav Nordh, 2008, Discret. Math..

NP-completeness of generalized multi-Skolem sequences

Gustav Nordh, 2007, Discret. Appl. Math..

What makes propositional abduction tractable

Gustav Nordh, Bruno Zanuttini, Gustav Nordh, 2008, Artif. Intell..

Approximability of Clausal Constraints

Gustav Nordh, Peter Jonsson, P. Jonsson, 2010, Theory of Computing Systems.

Constructing NP-intermediate problems by blowing holes with parameters of various properties

Gustav Nordh, Peter Jonsson, Victor Lagerkvist, 2015, Theor. Comput. Sci..

Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis

Gustav Nordh, Peter Jonsson, Bruno Zanuttini, 2013, SODA.

The complexity of equivalence and isomorphism of systems of equations over finite groups

Gustav Nordh, 2005, Theor. Comput. Sci..

An algebraic approach to the complexity of propositional circumscription

Gustav Nordh, Peter Jonsson, P. Jonsson, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

Trichotomies in the Complexity of Minimal Inference

Gustav Nordh, Arnaud Durand, Miki Hermann, 2009, Theory of Computing Systems.

Frozen Boolean Partial Co-clones

Gustav Nordh, Bruno Zanuttini, Gustav Nordh, 2009, 2009 39th International Symposium on Multiple-Valued Logic.

A note on the hardness of Skolem-type sequences

Gustav Nordh, 2010, Discret. Appl. Math..

Strong partial clones and the time complexity of SAT problems

Gustav Nordh, Peter Jonsson, Bruno Zanuttini, 2017, J. Comput. Syst. Sci..

A Trichotomy in the Complexity of Propositional Circumscription

Gustav Nordh, Gustav Nordh, 2005, LPAR.

Polymorphisms and Circuit Complexity pdf

Gustav Nordh, 2016, ArXiv.

A note on X-rays of permutations and a problem of Brualdi and Fritscher pdf

Gustav Nordh, 2017, ArXiv.

The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups

Gustav Nordh, Peter Jonsson, 2004, COCOON.

Retractions to Pseudoforests

Gustav Nordh, Pavol Hell, Peter Jonsson, 2010, SIAM J. Discret. Math..

An algebraic approach to the complexity of propositional circumscription

Gustav Nordh, Peter Jonsson, 2004, LICS 2004.

Complexity Dichotomies for CSP-related Problems

Gustav Nordh, Gustav Nordh, 2007 .