zbMATH — the first resource for mathematics

Phase transitions of EXPSPACE-complete problems: a further step. (English) Zbl 1246.68206

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Full Text: DOI
[1] DOI: 10.1016/j.artint.2007.04.001 · Zbl 1168.68554
[2] DOI: 10.1016/j.tcs.2006.01.001 · Zbl 1088.68163
[3] DOI: 10.1126/science.264.5163.1297 · Zbl 1226.68097
[4] DOI: 10.1016/S0004-3702(96)00030-6 · Zbl 0907.68177
[5] Xu Ke, Journal of Artificial Intelligence Research 12 pp 93–
[6] DOI: 10.1002/rsa.20015 · Zbl 1077.68118
[7] DOI: 10.1016/j.dam.2006.09.014 · Zbl 1123.68117
[8] DOI: 10.1142/S012905411000774X · Zbl 1215.68162
[9] Helmert M., Journal of Artificial Intelligence Research 26 pp 191– · JFM 01.0389.02
[10] Junping Zhou, Journal of Software 20 pp 290–
[11] Cormen T. H., Introduction to Algorithms (1990) · Zbl 1158.68538
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.