( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis.

, , и . AAAI, стр. 12112-12119. AAAI Press, (2023)

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.

Hans-Peter Jönsson

Claus Jönsson

Franziska Jönsson

Jan Jonsson

Ingimar Jónsson

 

Другие публикации лиц с тем же именем

Building tractable disjunctive constraints., , , и . J. ACM, 47 (5): 826-853 (2000)Planning with Abstraction Hierarchies can be Exponentially Less Efficient., и . IJCAI, стр. 1599-1605. Morgan Kaufmann, (1995)Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra., , и . J. ACM, 50 (5): 591-640 (2003)Properties of an Approximability-related Parameter on Circular Complete Graphs., , , и . Electron. Notes Discret. Math., (2009)A Complete Classification of Tractability in RCC-5, и . CoRR, (1997)Bounded Tree-Width and CSP-Related Problems., и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 632-643. Springer, (2007)Approximability of Integer Programming with Generalised Constraints., , и . CP, том 4204 из Lecture Notes in Computer Science, стр. 256-270. Springer, (2006)Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs., и . CP, том 9255 из Lecture Notes in Computer Science, стр. 183-199. Springer, (2015)Introduction to the Maximum SolutionProblem., и . Complexity of Constraints, том 5250 из Lecture Notes in Computer Science, стр. 255-282. Springer, (2008)Parameterized Complexity and Kernel Bounds for Hard Planning Problems, , , и . CoRR, (2012)