×

zbMATH — the first resource for mathematics

Nordh, Gustav

Compute Distance To:
Author ID: nordh.gustav Recent zbMATH articles by "Nordh, Gustav"
Published as: Nordh, Gustav
External Links: MGP
Documents Indexed: 20 Publications since 2004

Publications by Year

Citations contained in zbMATH Open

15 Publications have been cited 58 times in 45 Documents Cited by Year
Retractions to pseudoforests. Zbl 1215.05063
Feder, Tomás; Hell, Pavol; Jonsson, Peter; Krokhin, Andrei; Nordh, Gustav
9
2010
What makes propositional abduction tractable. Zbl 1183.68600
Nordh, Gustav; Zanuttini, Bruno
8
2008
The maximum solution problem on graphs. Zbl 1147.68532
Jonsson, Peter; Nordh, Gustav; Thapper, Johan
7
2007
Max Ones generalized to larger domains. Zbl 1162.68015
Jonsson, Peter; Kuivinen, Fredrik; Nordh, Gustav
6
2008
A trichotomy in the complexity of propositional circumscription. Zbl 1108.68580
Nordh, Gustav
6
2005
Introduction to the Maximum Solution problem. Zbl 1171.68499
Jonsson, Peter; Nordh, Gustav
4
2008
Complexity of SAT problems, clone theory and the exponential time hypothesis. Zbl 1423.68212
Jonsson, Peter; Lagerkvist, Victor; Nordh, Gustav; Zanuttini, Bruno
4
2013
Strong partial clones and the time complexity of SAT problems. Zbl 1353.68133
Jonsson, Peter; Lagerkvist, Victor; Nordh, Gustav; Zanuttini, Bruno
3
2017
Constructing NP-intermediate problems by blowing holes with parameters of various properties. Zbl 1318.68094
Jonsson, Peter; Lagerkvist, Victor; Nordh, Gustav
2
2015
The complexity of counting solutions to systems of equations over finite semigroups. Zbl 1091.68061
Nordh, Gustav; Jonsson, Peter
2
2004
Perfect Skolem sets. Zbl 1135.05002
Nordh, Gustav
2
2008
Generalised integer programming based on logically defined relations. Zbl 1132.90355
Jonsson, Peter; Nordh, Gustav
2
2006
A note on the hardness of Skolem-type sequences. Zbl 1232.05046
Nordh, Gustav
1
2010
The complexity of equivalence and isomorphism of systems of equations over finite groups. Zbl 1079.68044
Nordh, Gustav
1
2005
\(\mathcal{NP}\)-completeness of generalized multi-Skolem sequences. Zbl 1180.05025
Nordh, Gustav
1
2007
Strong partial clones and the time complexity of SAT problems. Zbl 1353.68133
Jonsson, Peter; Lagerkvist, Victor; Nordh, Gustav; Zanuttini, Bruno
3
2017
Constructing NP-intermediate problems by blowing holes with parameters of various properties. Zbl 1318.68094
Jonsson, Peter; Lagerkvist, Victor; Nordh, Gustav
2
2015
Complexity of SAT problems, clone theory and the exponential time hypothesis. Zbl 1423.68212
Jonsson, Peter; Lagerkvist, Victor; Nordh, Gustav; Zanuttini, Bruno
4
2013
Retractions to pseudoforests. Zbl 1215.05063
Feder, Tomás; Hell, Pavol; Jonsson, Peter; Krokhin, Andrei; Nordh, Gustav
9
2010
A note on the hardness of Skolem-type sequences. Zbl 1232.05046
Nordh, Gustav
1
2010
What makes propositional abduction tractable. Zbl 1183.68600
Nordh, Gustav; Zanuttini, Bruno
8
2008
Max Ones generalized to larger domains. Zbl 1162.68015
Jonsson, Peter; Kuivinen, Fredrik; Nordh, Gustav
6
2008
Introduction to the Maximum Solution problem. Zbl 1171.68499
Jonsson, Peter; Nordh, Gustav
4
2008
Perfect Skolem sets. Zbl 1135.05002
Nordh, Gustav
2
2008
The maximum solution problem on graphs. Zbl 1147.68532
Jonsson, Peter; Nordh, Gustav; Thapper, Johan
7
2007
\(\mathcal{NP}\)-completeness of generalized multi-Skolem sequences. Zbl 1180.05025
Nordh, Gustav
1
2007
Generalised integer programming based on logically defined relations. Zbl 1132.90355
Jonsson, Peter; Nordh, Gustav
2
2006
A trichotomy in the complexity of propositional circumscription. Zbl 1108.68580
Nordh, Gustav
6
2005
The complexity of equivalence and isomorphism of systems of equations over finite groups. Zbl 1079.68044
Nordh, Gustav
1
2005
The complexity of counting solutions to systems of equations over finite semigroups. Zbl 1091.68061
Nordh, Gustav; Jonsson, Peter
2
2004

Citations by Year