The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gustav Nordh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gustav Nordh, Peter Jonsson
    The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:370-379 [Conf]
  2. Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
    Approximability of Integer Programming with Generalised Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:256-270 [Conf]
  3. Gustav Nordh, Bruno Zanuttini
    Propositional Abduction is Almost Always Hard. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:534-539 [Conf]
  4. Gustav Nordh, Peter Jonsson
    An Algebraic Approach to the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:367-376 [Conf]
  5. Gustav Nordh
    A Trichotomy in the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:257-269 [Conf]
  6. Peter Jonsson, Gustav Nordh
    Generalised Integer Programming Based on Logically Defined Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:549-560 [Conf]
  7. Gustav Nordh
    The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:380-391 [Conf]
  8. Gustav Nordh
    The complexity of equivalence and isomorphism of systems of equations over finite groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:406-424 [Journal]
  9. Peter Jonsson, Gustav Nordh, Johan Thapper
    The Maximum Solution Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:228-239 [Conf]
  10. Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
    Approximability of Integer Programming with Generalised Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  11. Gustav Nordh
    NP-completeness of generalized multi-Skolem sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2061-2068 [Journal]

  12. Introduction to the Maximum SolutionProblem. [Citation Graph (, )][DBLP]


  13. Frozen Boolean Partial Co-clones. [Citation Graph (, )][DBLP]


  14. Trichotomy in the Complexity of Minimal Inference. [Citation Graph (, )][DBLP]


  15. Integer Programming with 2-Variable Equations and 1-Variable Inequalities. [Citation Graph (, )][DBLP]


  16. What makes propositional abduction tractable. [Citation Graph (, )][DBLP]


  17. A note on the hardness of Skolem-type sequences. [Citation Graph (, )][DBLP]


  18. Perfect Skolem sets. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002