Comparing the power of games on graphs

Mathematical Logic Quarterly

Volumn 43, Issue 4, 1997, Pages 431-455

  Fagin, Ronald ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Ajtai fagin game; Computational complexity; Descriptive complexity; Ehrenfeucht fra ss game; Finite model theory; Monadic NP

Indexed keywords

EID: 0031285805     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.19970430402     Document Type: Article

References (9)

1. AJTAI, M., and R. FAGIN, Reachability is harder for directed than for undirected finite graphs. J. Symbolic Logic 55 (1990), 113-150.
2. ARORA, S., and R. FAGIN, On winning strategies in Ehrenfeucht-Fraïssé games. Research Report RJ 9833, IBM, June 1994; to appear in Theoretical Computer Science.
3. DURAND, A., C. LAUTEMANN, and T. SCHWENTICK, Subclasses of binary NP. To appear in Journal of Logic and Computation.
4. EHRENFEUCHT, A., An application of games to the completeness problem for formalized theories. Fund. Math. 49 (1961), 129-141.
5. FAGIN, R., Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of Computation (R. M. KARP, ed.), SIAM-AMS Proceedings 7 (1974), 43-73.
6. FAGIN, R., Monadic generalized spectra. Zeitschrift Math. Logik Grundlagen Math. 21 (1975), 89-96.
7. FRAÏSSÉ, R., Sur quelques classifications des systèmes de relations. Publ. Sci. Univ. Alger., Sér. A, 1 (1954), 35-182.
8. FAGIN, R., L. STOCKMEYER, and M. Y. VARDI, On monadic NP versus monadic co-NP. Information and Computation 120 (1995), 78-92.
9. IMMERMAN N., Descriptive and computational complexity. In: Computational Complexity Theory (J. HARTMANIS, ed.), Proc. AMS Symp. in Appl. Math. 38 (1989), 75-91.