Author:
Bäckström Christer,Jonsson Peter,Ordyniak Sebastian,Szeider Stefan
Funder
European Research Council
Employment of Newly Graduated Doctors of Science for Scientific Excellence
Austrian Science Fund
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference50 articles.
1. Solving MAX-r-SAT above a tight lower bound;Alon;Algorithmica,2011
2. Computational complexity of reasoning about plans;Bäckström,1992
3. Expressive equivalence of planning formalisms;Bäckström;Artif. Intell.,1995
4. The complexity of planning revisited – a parameterized analysis;Bäckström,2012
5. From macro plans to automata plans;Bäckström,2012
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献