Phase transitions of expspace-complete problems: A further step

International Journal of Foundations of Computer Science

Volumn 23, Issue 1, 2012, Pages 173-184

  Zhou, Junping ^a   Yin, Minghao ^a   Li, Xiangtao ^a   Wang, Jinyan ^a  

^a NORTHEAST NORMAL UNIVERSITY   (China)

Author keywords

conformant plan modification; conformant planning; EXPSPACE complete; lower bound; Phase transition; upper bound

Indexed keywords

EID: 84863120132     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054112500025     Document Type: Article

References (15)

1. Ke Xu, Frederic Boussemart, Fred Hemery, Christophe Lecoutre, Random constraint satisfaction: Easy generation of hard (satisfiable) instances, Artificial Intelligence. 171 (8-9) (2007) 514-534. (Pubitemid 46828981)
2. Tian Liu, Xiaxiang Lin, Chaoyi Wang, Kaile Su, Ke Xu, Large hinge width on sparse random hypergraphs, in Proceedings of the 22nd International Joint Conference on Artificial Intelligence, eds. Toby Walsh (Barcelona, Catalonia, Spain, 2011), pp. 611-616.
3. Ke Xu, Wei Li, Many hard examples in exact phase transitions, Theoretical Computer Science. 355 (3) (2006) 291-302.
4. Scott Kirkpatrick, Bart Selman, Critical behavior in the satisfiability of random boolean expressions, Science. 264 (5163) (1994) 1297-1301. (Pubitemid 24220129)
5. Ian P. Gent, Toby Walsh, The TSP phase transition, Artificial Intelligence. 88 (1-2) (1996) 349-358. (Pubitemid 126371546)
6. Ke Xu, Wei Li, Exact phase transitions in random constraint satisfaction problems, Journal of Artificial Intelligence Research. 12 (1) (2000) 93-103.
7. Don Coppersmith, David Gamarnik, MohammadTaghi Hajiaghayi, Gregory B. Sorkin, Random MAX SAT, random MAX CUT, and their phase transitions, Random Structures and Algorithms. 24 (4) (2004) 502-545. (Pubitemid 40031429)
8. Ian Gent And, Ian P. Gent, Toby Walsh, Beyond NP the QSAT phase transition, in Proceedings of the Sixteenth National Conference on Artificial Intelligence,eds. Shlomo Zilberstein, Jana Koehler, Sven Koenig (Orlando, Florida, 1999), pp. 648-653.
9. Delbert D. Bailey, Vlctor Dalmau, Phokion G. Kolaitis, Phase transitions of PP-complete satisfiability problems,Discrete Applied Mathematics. 155 (12) (2007) 1627-1639. (Pubitemid 46908834)
10. Junping Zhou, Ping Huang, Minghao Yin, Chunguang Zhou, Phase transitions of EXPSPACEcomplete problems, International Journal of Foundations of Computer Science. 21 (6) (2010) 1073-1088.
11. Helmert M., The fast downward planning system, Journal of Artificial Intelligence Research. 26(2006) 191-246. (Pubitemid 44452211)
12. Zhou Junping, Yin Minghao, Gu Wenxiang, Sun Jigui, Decrease observation variables for strong planning under partial observation, Journal of Software. 20 (2) (2009) 290-304.
13. Bernhard Nebel, Jana Koehler, Plan modification versus plan generation: A complexitytheoretic perspective, in Proceedings of the 13th International Joint Conference on Artificial Intelligence, eds.Ruzena Bajcsy (Chambry, France, 1993), pp. 1436-1444.
14. Jussi Rintanen, Phase transitions in classical planning: An experimental study, in Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling , eds. Shlomo Zilberstein, Jana Koehler, Sven Koenig (British Columbia, Canada, 2004), pp.101-110. (Pubitemid 40201836)
15. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms MIT Press, 1990.