We stand with Ukraine

We stand with Ukraine

Gustav Nordh

Affiliations:

Linköping University, Sweden

According to our database¹, Gustav Nordh authored at least 29 papers between 2004 and 2019.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on ida.liu.se

On csauthors.net:

Bibliography

2019

On the Strength of Uniqueness Quantification in Primitive Positive Formulas.

[BibT_eX]

[DOI]

Victor Lagerkvist

,

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2017

Strong partial clones and the time complexity of SAT problems.

[BibT_eX]

[DOI]

,

Victor Lagerkvist

,

,

Bruno Zanuttini

J. Comput. Syst. Sci., 2017

A note on X-rays of permutations and a problem of Brualdi and Fritscher.

[BibT_eX]

[DOI]

CoRR, 2017

A Note on the Power of Non-Deterministic Circuits with Gate Restrictions.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Polymorphisms and Circuit Complexity.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Constructing NP-intermediate problems by blowing holes with parameters of various properties.

[BibT_eX]

[DOI]

,

Victor Lagerkvist

,

Theor. Comput. Sci., 2015

2013

Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis.

[BibT_eX]

[DOI]

,

Victor Lagerkvist

,

,

Bruno Zanuttini

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction.

[BibT_eX]

[DOI]

,

Victor Lagerkvist

,

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

Trichotomies in the Complexity of Minimal Inference.

[BibT_eX]

[DOI]

,

,

Theory Comput. Syst., 2012

2010

Retractions to Pseudoforests.

[BibT_eX]

[DOI]

,

,

,

Andrei A. Krokhin

,

SIAM J. Discret. Math., 2010

Approximability of Clausal Constraints.

[BibT_eX]

[DOI]

,

Theory Comput. Syst., 2010

A note on the hardness of Skolem-type sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

Integer programming with 2-variable equations and 1-variable inequalities.

[BibT_eX]

[DOI]

Manuel Bodirsky

,

,

Timo von Oertzen

Inf. Process. Lett., 2009

Trichotomy in the Complexity of Minimal Inference.

[BibT_eX]

[DOI]

,

,

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Frozen Boolean Partial Co-clones.

[BibT_eX]

[DOI]

,

Bruno Zanuttini

Proceedings of the ISMVL 2009, 2009

2008

MAX ONES Generalized to Larger Domains.

[BibT_eX]

[DOI]

,

Fredrik Kuivinen

,

SIAM J. Comput., 2008

Perfect Skolem sets.

[BibT_eX]

[DOI]

Discret. Math., 2008

What makes propositional abduction tractable.

[BibT_eX]

[DOI]

,

Bruno Zanuttini

Artif. Intell., 2008

Introduction to the Maximum SolutionProblem.

[BibT_eX]

[DOI]

,

Proceedings of the Complexity of Constraints, 2008

2007

Complexity Dichotomies for CSP-related Problems.

[BibT_eX]

[DOI]

PhD thesis, 2007

NP-completeness of generalized multi-Skolem sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

The Maximum Solution Problem on Graphs.

[BibT_eX]

[DOI]

,

,

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Generalised Integer Programming Based on Logically Defined Relations.

[BibT_eX]

[DOI]

,

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Approximability of Integer Programming with Generalised Constraints.

[BibT_eX]

[DOI]

,

Fredrik Kuivinen

,

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

The complexity of equivalence and isomorphism of systems of equations over finite groups.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Propositional Abduction is Almost Always Hard.

[BibT_eX]

[DOI]

,

Bruno Zanuttini

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004

A Trichotomy in the Complexity of Propositional Circumscription.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2004

An Algebraic Approach to the Complexity of Propositional Circumscription.

[BibT_eX]

[DOI]

,

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups.

[BibT_eX]

[DOI]

,

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Loading...