Gustav Nordh

Publication Activity (10 Years)

Years Active: 2004-2019
Publications (10 Years): 7

Top Topics

Positive Samples

Computational Problems

Constraint Satisfaction Problems

Top Venues

J. Comput. Syst. Sci.

Theory Comput. Syst.

Publications

Victor Lagerkvist, Gustav Nordh
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. CoRR (2019)
Victor Lagerkvist, Gustav Nordh
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. MFCS (2019)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84 (2017)
Gustav Nordh
A note on X-rays of permutations and a problem of Brualdi and Fritscher. CoRR (2017)
Gustav Nordh
A Note on the Power of Non-Deterministic Circuits with Gate Restrictions. CoRR (2017)
Gustav Nordh
Polymorphisms and Circuit Complexity. CoRR (2016)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
Constructing NP-intermediate problems by blowing holes with parameters of various properties. Theor. Comput. Sci. 581 (2015)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. CP (2013)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA (2013)
Arnaud Durand, Miki Hermann, Gustav Nordh
Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50 (3) (2012)
Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
Retractions to Pseudoforests. SIAM J. Discret. Math. 24 (1) (2010)
Peter Jonsson, Gustav Nordh
Approximability of Clausal Constraints. Theory Comput. Syst. 46 (2) (2010)
Gustav Nordh
A note on the hardness of Skolem-type sequences. Discret. Appl. Math. 158 (8) (2010)
Arnaud Durand, Miki Hermann, Gustav Nordh
Trichotomy in the Complexity of Minimal Inference. LICS (2009)
Gustav Nordh, Bruno Zanuttini
Frozen Boolean Partial Co-clones. ISMVL (2009)
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW (2009)
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
Integer programming with 2-variable equations and 1-variable inequalities. Inf. Process. Lett. 109 (11) (2009)
Peter Jonsson, Gustav Nordh
Introduction to the Maximum SolutionProblem. Complexity of Constraints (2008)
Gustav Nordh, Bruno Zanuttini
What makes propositional abduction tractable. Artif. Intell. 172 (10) (2008)
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
MAX ONES Generalized to Larger Domains. SIAM J. Comput. 38 (1) (2008)
Gustav Nordh
Perfect Skolem sets. Discret. Math. 308 (9) (2008)
Gustav Nordh
NP-completeness of generalized multi-Skolem sequences. Discret. Appl. Math. 155 (16) (2007)
Peter Jonsson, Gustav Nordh, Johan Thapper
The Maximum Solution Problem on Graphs. MFCS (2007)
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
Approximability of Integer Programming with Generalised Constraints CoRR (2006)
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
Approximability of Integer Programming with Generalised Constraints. CP (2006)
Peter Jonsson, Gustav Nordh
Generalised Integer Programming Based on Logically Defined Relations. MFCS (2006)
Gustav Nordh
The complexity of equivalence and isomorphism of systems of equations over finite groups. Theor. Comput. Sci. 345 (2-3) (2005)
Gustav Nordh, Bruno Zanuttini
Propositional Abduction is Almost Always Hard. IJCAI (2005)
Gustav Nordh
A Trichotomy in the Complexity of Propositional Circumscription. LPAR (2004)
Gustav Nordh
The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups. MFCS (2004)
Gustav Nordh, Peter Jonsson
An Algebraic Approach to the Complexity of Propositional Circumscription. LICS (2004)
Gustav Nordh, Peter Jonsson
The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. COCOON (2004)