Gustav Nordh

Available identifiers

zbMath Open nordh.gustavMaRDI QIDQ340558

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5092397	2022-07-21	Paper
On the Strength of Uniqueness Quantification in Primitive Positive Formulas	2019-06-17	Paper
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis	2019-05-15	Paper
A note on X-rays of permutations and a problem of Brualdi and Fritscher	2017-07-12	Paper
Strong partial clones and the time complexity of SAT problems	2016-11-14	Paper
Constructing NP-intermediate problems by blowing holes with parameters of various properties	2015-05-22	Paper
Trichotomies in the complexity of minimal inference	2012-12-06	Paper
Retractions to Pseudoforests	2011-03-15	Paper
Integer programming with 2-variable equations and 1-variable inequalities	2010-08-16	Paper
A note on the hardness of Skolem-type sequences	2010-05-25	Paper
Approximability of clausal constraints	2010-05-10	Paper
What makes propositional abduction tractable	2009-07-17	Paper
MAX ONES Generalized to Larger Domains	2009-03-16	Paper
Introduction to the Maximum Solution Problem	2009-01-22	Paper
The Maximum Solution Problem on Graphs	2008-09-17	Paper
Approximability of Integer Programming with Generalised Constraints	2008-09-09	Paper
Perfect Skolem sets	2008-03-13	Paper
\(\mathcal{NP}\)-completeness of generalized multi-Skolem sequences	2007-09-21	Paper
Generalised Integer Programming Based on Logically Defined Relations	2007-09-05	Paper
The complexity of equivalence and isomorphism of systems of equations over finite groups	2005-12-06	Paper
Logic for Programming, Artificial Intelligence, and Reasoning	2005-11-10	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Computing and Combinatorics	2005-06-15	Paper

Research outcomes over time

This page was built for person: Gustav Nordh