2008 |
15 | EE | Peter Jonsson,
Gustav Nordh:
Introduction to the Maximum SolutionProblem.
Complexity of Constraints 2008: 255-282 |
14 | EE | Gustav Nordh,
Bruno Zanuttini:
What makes propositional abduction tractable.
Artif. Intell. 172(10): 1245-1284 (2008) |
13 | EE | Gustav Nordh:
Perfect Skolem sets.
Discrete Mathematics 308(9): 1653-1664 (2008) |
12 | EE | Peter Jonsson,
Fredrik Kuivinen,
Gustav Nordh:
MAX ONES Generalized to Larger Domains.
SIAM J. Comput. 38(1): 329-365 (2008) |
2007 |
11 | EE | Peter Jonsson,
Gustav Nordh,
Johan Thapper:
The Maximum Solution Problem on Graphs.
MFCS 2007: 228-239 |
10 | EE | Gustav Nordh:
NP-completeness of generalized multi-Skolem sequences.
Discrete Applied Mathematics 155(16): 2061-2068 (2007) |
2006 |
9 | EE | Peter Jonsson,
Fredrik Kuivinen,
Gustav Nordh:
Approximability of Integer Programming with Generalised Constraints.
CP 2006: 256-270 |
8 | EE | Peter Jonsson,
Gustav Nordh:
Generalised Integer Programming Based on Logically Defined Relations.
MFCS 2006: 549-560 |
7 | EE | Peter Jonsson,
Fredrik Kuivinen,
Gustav Nordh:
Approximability of Integer Programming with Generalised Constraints
CoRR abs/cs/0602047: (2006) |
2005 |
6 | EE | Gustav Nordh,
Bruno Zanuttini:
Propositional Abduction is Almost Always Hard.
IJCAI 2005: 534-539 |
5 | EE | Gustav Nordh:
The complexity of equivalence and isomorphism of systems of equations over finite groups.
Theor. Comput. Sci. 345(2-3): 406-424 (2005) |
2004 |
4 | EE | Gustav Nordh,
Peter Jonsson:
The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups.
COCOON 2004: 370-379 |
3 | EE | Gustav Nordh,
Peter Jonsson:
An Algebraic Approach to the Complexity of Propositional Circumscription.
LICS 2004: 367-376 |
2 | EE | Gustav Nordh:
A Trichotomy in the Complexity of Propositional Circumscription.
LPAR 2004: 257-269 |
1 | EE | Gustav Nordh:
The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups.
MFCS 2004: 380-391 |