1. Structure preserving reductions among convex optimizations problems;Ausiello;J. Comput. Syst. Sci.,1980
2. Computational complexity of reasoning about plans;Bäckström,1992
3. Equivalence and tractability results for SAS+ planning;Bäckström,1992
4. Parallel non-binary planning in polynomial time;Bäckström,1991
5. Planning in polynomial time: the SAS-PUBS class;Bäckström;Comput. Intelligence,1991