| What makes propositional abduction tractable G Nordh, B Zanuttini Artificial Intelligence 172 (10), 1245-1284, 2008 | 60 | 2008 |
| Strong partial clones and the time complexity of SAT problems P Jonsson, V Lagerkvist, G Nordh, B Zanuttini Journal of Computer and System Sciences 84, 52-78, 2017 | 39 | 2017 |
| Retractions to pseudoforests T Feder, P Hell, P Jonsson, A Krokhin, G Nordh SIAM Journal on Discrete Mathematics 24 (1), 101-112, 2010 | 38 | 2010 |
| Complexity of SAT problems, clone theory and the exponential time hypothesis P Jonsson, V Lagerkvist, G Nordh, B Zanuttini Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 30 | 2013 |
| MAX ONES generalized to larger domains P Jonsson, F Kuivinen, G Nordh SIAM Journal on Computing 38 (1), 329-365, 2008 | 26 | 2008 |
| Introduction to the Maximum Solution Problem P Jonsson, G Nordh Complexity of Constraints: An Overview of Current Research Themes, 255-282, 2008 | 25 | 2008 |
| Frozen Boolean partial co-clones G Nordh, B Zanuttini 2009 39th International Symposium on Multiple-Valued Logic, 120-125, 2009 | 23 | 2009 |
| Propositional abduction is almost always hard G Nordh, B Zanuttini International Joint Conference on Artificial Intelligence 19, 534, 2005 | 22 | 2005 |
| A trichotomy in the complexity of propositional circumscription G Nordh International Conference on Logic for Programming Artificial Intelligence …, 2005 | 22 | 2005 |
| The maximum solution problem on graphs P Jonsson, G Nordh, J Thapper Mathematical Foundations of Computer Science 2007: 32nd International …, 2007 | 16 | 2007 |
| Perfect skolem sets G Nordh Discrete mathematics 308 (9), 1653-1664, 2008 | 15 | 2008 |
| An algebraic approach to the complexity of propositional circumscription G Nordh, P Jonsson Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 12 | 2004 |
| Trichotomies in the complexity of minimal inference A Durand, M Hermann, G Nordh Theory of Computing Systems 50 (3), 446-491, 2012 | 11 | 2012 |
| The complexity of counting solutions to systems of equations over finite semigroups G Nordh, P Jonsson Computing and Combinatorics: 10th Annual International Conference, COCOON …, 2004 | 11 | 2004 |
| Generalised integer programming based on logically defined relations P Jonsson, G Nordh International Symposium on Mathematical Foundations of Computer Science, 549-560, 2006 | 10 | 2006 |
| Integer programming with 2-variable equations and 1-variable inequalities M Bodirsky, G Nordh, T von Oertzen Information processing letters 109 (11), 572-575, 2009 | 9 | 2009 |
| Generalization of Skolem sequences G Nordh Master's Thesis, Department of Mathematics, Linköpings Universitet, Sweden, 2003 | 8 | 2003 |
| Constructing np-intermediate problems by blowing holes with parameters of various properties P Jonsson, V Lagerkvist, G Nordh Theoretical Computer Science 581, 67-82, 2015 | 6 | 2015 |
| A note on the hardness of Skolem-type sequences G Nordh Discrete applied mathematics 158 (8), 964-966, 2010 | 5 | 2010 |
| NP-completeness of generalized multi-Skolem sequences G Nordh Discrete applied mathematics 155 (16), 2061-2068, 2007 | 4 | 2007 |
