default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGustav Nordh
Person information
- affiliation: Linköping University, Sweden
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c15]Victor Lagerkvist, Gustav Nordh:
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. MFCS 2019: 36:1-36:15- [i5]Victor Lagerkvist, Gustav Nordh:
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. CoRR abs/1906.07031 (2019) - 2017
- [j12]Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84: 52-78 (2017) - [i4]Gustav Nordh:
A Note on the Power of Non-Deterministic Circuits with Gate Restrictions. CoRR abs/1705.03263 (2017) - [i3]Gustav Nordh:
A note on X-rays of permutations and a problem of Brualdi and Fritscher. CoRR abs/1707.03928 (2017) - 2016
- [i2]Gustav Nordh:
Polymorphisms and Circuit Complexity. CoRR abs/1609.04274 (2016) - 2015
- [j11]Peter Jonsson, Victor Lagerkvist, Gustav Nordh:
Constructing NP-intermediate problems by blowing holes with parameters of various properties. Theor. Comput. Sci. 581: 67-82 (2015) - 2013
- [c14]Peter Jonsson, Victor Lagerkvist, Gustav Nordh:
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. CP 2013: 398-414 - [c13]Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA 2013: 1264-1277 - 2012
- [j10]Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50(3): 446-491 (2012) - 2010
- [j9]Gustav Nordh:
A note on the hardness of Skolem-type sequences. Discret. Appl. Math. 158(8): 964-966 (2010) - [j8]Peter Jonsson, Gustav Nordh:
Approximability of Clausal Constraints. Theory Comput. Syst. 46(2): 370-395 (2010) - [j7]Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin
, Gustav Nordh:
Retractions to Pseudoforests. SIAM J. Discret. Math. 24(1): 101-112 (2010)
2000 – 2009
- 2009
- [j6]Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer programming with 2-variable equations and 1-variable inequalities. Inf. Process. Lett. 109(11): 572-575 (2009) - [c12]Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW 2009: 261-264 - [c11]Gustav Nordh, Bruno Zanuttini:
Frozen Boolean Partial Co-clones. ISMVL 2009: 120-125 - [c10]Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomy in the Complexity of Minimal Inference. LICS 2009: 387-396 - 2008
- [j5]Gustav Nordh, Bruno Zanuttini:
What makes propositional abduction tractable. Artif. Intell. 172(10): 1245-1284 (2008) - [j4]Gustav Nordh:
Perfect Skolem sets. Discret. Math. 308(9): 1653-1664 (2008) - [j3]Peter Jonsson, Fredrik Kuivinen, Gustav Nordh:
MAX ONES Generalized to Larger Domains. SIAM J. Comput. 38(1): 329-365 (2008) - [c9]Peter Jonsson, Gustav Nordh:
Introduction to the Maximum SolutionProblem. Complexity of Constraints 2008: 255-282 - 2007
- [b1]Gustav Nordh:
Complexity Dichotomies for CSP-related Problems. Linköping University, Sweden, 2007 - [j2]Gustav Nordh:
NP-completeness of generalized multi-Skolem sequences. Discret. Appl. Math. 155(16): 2061-2068 (2007) - [c8]Peter Jonsson, Gustav Nordh, Johan Thapper:
The Maximum Solution Problem on Graphs. MFCS 2007: 228-239 - 2006
- [c7]Peter Jonsson, Fredrik Kuivinen, Gustav Nordh:
Approximability of Integer Programming with Generalised Constraints. CP 2006: 256-270 - [c6]Peter Jonsson, Gustav Nordh:
Generalised Integer Programming Based on Logically Defined Relations. MFCS 2006: 549-560 - [i1]Peter Jonsson, Fredrik Kuivinen, Gustav Nordh:
Approximability of Integer Programming with Generalised Constraints. CoRR abs/cs/0602047 (2006) - 2005
- [j1]Gustav Nordh:
The complexity of equivalence and isomorphism of systems of equations over finite groups. Theor. Comput. Sci. 345(2-3): 406-424 (2005) - [c5]Gustav Nordh, Bruno Zanuttini:
Propositional Abduction is Almost Always Hard. IJCAI 2005: 534-539 - 2004
- [c4]Gustav Nordh, Peter Jonsson:
The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. COCOON 2004: 370-379 - [c3]Gustav Nordh, Peter Jonsson:
An Algebraic Approach to the Complexity of Propositional Circumscription. LICS 2004: 367-376 - [c2]Gustav Nordh:
A Trichotomy in the Complexity of Propositional Circumscription. LPAR 2004: 257-269 - [c1]Gustav Nordh:
The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups. MFCS 2004: 380-391
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-16 22:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
