Author of the publication

Refining complexity analyses in planning by exploiting the exponential time hypothesis.

, , , and . Ann. Math. Artif. Intell., 78 (2): 157-175 (2016)

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.

 

Other publications of authors with the same name

A Nonapproximability Result for Finite Function Generation.. Inf. Process. Lett., 63 (3): 143-145 (1997)Approximability Distance in the Space of H-Colourability Problems, , and . CoRR, (2008)The approximability of MAX CSP with fixed-value constraints, , , and . CoRR, (2006)Bounded Tree-Width and CSP-Related Problems., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 632-643. Springer, (2007)Introduction to the Maximum SolutionProblem., and . Complexity of Constraints, volume 5250 of Lecture Notes in Computer Science, page 255-282. Springer, (2008)Approximability of Integer Programming with Generalised Constraints., , and . CP, volume 4204 of Lecture Notes in Computer Science, page 256-270. Springer, (2006)Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs., and . CP, volume 9255 of Lecture Notes in Computer Science, page 183-199. Springer, (2015)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)