Gustav Nordh

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