×

zbMATH — the first resource for mathematics

Phase transitions of EXPSPACE-complete problems. (English) Zbl 1215.68162

MSC:
68Q87 Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] DOI: 10.1016/0004-3702(95)00045-3
[2] Remi Monasson, Nature 400 pp 133–
[3] DOI: 10.1090/S0894-0347-99-00305-7 · Zbl 0932.05084
[4] Frieze A., Journal of Algorithms 53 pp 469– · Zbl 0729.68029
[5] DOI: 10.1002/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U · Zbl 0936.68038
[6] DOI: 10.1016/S0004-3702(96)00030-6 · Zbl 0907.68177
[7] Xu Ke, Journal of Artificial Intelligence Research 12 pp 93–
[8] DOI: 10.1002/rsa.20015 · Zbl 1077.68118
[9] Bryce D., Journal of Artificial Intelligence Research 26 pp 35–
[10] Helmert M., Journal of Artificial Intelligence Research 26 pp 191– · JFM 01.0389.02
[11] DOI: 10.1016/j.artint.2008.11.012 · Zbl 1191.68636
[12] Junping Zhou, Journal of Software 20 pp 290–
[13] 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.