( en | de | ru )

 

Disambiguation of "Jonsson, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
Computational complexity of linear constraints over the integers.

, and . Artif. Intell., (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hans-Peter Jönsson

Franziska Jönsson

Claus Jönsson

Jan Jonsson

Ingimar Jónsson

 

Other publications of authors with the same name

Computational complexity of auditing finite attributes in statistical databases., and . J. Comput. Syst. Sci., 74 (5): 898-909 (2008)Constructing NP-intermediate problems by blowing holes with parameters of various properties., , and . Theor. Comput. Sci., (2015)Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights.. Theor. Comput. Sci., 244 (1-2): 189-203 (2000)A Complete Classification of Tractability in RCC-5, and . CoRR, (1997)Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra., , and . J. ACM, 50 (5): 591-640 (2003)Properties of an Approximability-related Parameter on Circular Complete Graphs., , , and . Electron. Notes Discret. Math., (2009)Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis., , and . AAAI, page 12112-12119. AAAI Press, (2023)From Macro Plans to Automata Plans., , and . ECAI, volume 242 of Frontiers in Artificial Intelligence and Applications, page 91-96. IOS Press, (2012)Upper and Lower Time and Space Bounds for Planning., and . ECAI, volume 285 of Frontiers in Artificial Intelligence and Applications, page 716-724. IOS Press, (2016)Adding clauses to poor man's logic (without increasing the complexity).. J. Appl. Non Class. Logics, 15 (3): 341-357 (2005)