Gustav Nordh - Citegraph

Author Info

Name	Affiliation	Papers
GUSTAV NORDH	Linkoping Univ, Dept Comp & Informat Sci, SE-58183 Linkoping, Sweden	22
Collaborators	Citations	PageRank
13	121	10.40
Referers	Referees	References
137	282	365

Search Limit

100282

Publications (22 rows)

Collaborators (13 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On the Strength of Uniqueness Quantification in Primitive Positive Formulas.	0	0.34	2019
Strong partial clones and the time complexity of SAT problems.	6	0.54	2017
Constructing NP-intermediate problems by blowing holes with parameters of various properties	0	0.34	2015
Complexity of SAT problems, clone theory and the exponential time hypothesis	14	0.81	2013
Retractions to Pseudoforests	11	0.55	2010
Approximability of Clausal Constraints	1	0.36	2010
A note on the hardness of Skolem-type sequences	3	0.55	2010
Frozen Boolean Partial Co-clones	7	0.50	2009
Integer Programming with 2-Variable Equations and 1-Variable Inequalities	3	0.38	2009
Trichotomy in the Complexity of Minimal Inference	4	0.42	2009
What makes propositional abduction tractable	12	0.55	2008
Perfect Skolem sets	1	0.40	2008
Introduction to the Maximum SolutionProblem	2	0.36	2008
MAX ONES Generalized to Larger Domains	9	0.49	2008
NP-completeness of generalized multi-Skolem sequences	1	0.40	2007
The maximum solution problem on graphs	8	0.48	2007
Generalised integer programming based on logically defined relations	7	0.47	2006
Approximability of integer programming with generalised constraints	2	0.37	2006
The complexity of equivalence and isomorphism of systems of equations over finite groups	3	0.45	2005
Propositional abduction is almost always hard	10	0.56	2005
An Algebraic Approach to the Complexity of Propositional Circumscription	7	0.52	2004
A Trichotomy in the Complexity of Propositional Circumscription.	10	0.54	2004