Computational complexity of ehrenfeucht-fraïssé games on finite structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1584, Issue , 1999, Pages 159-170

  Pezzoli, Elena ^a  

^a BOSTON COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXISTENTIAL FORMULA; FINITE STRUCTURES; FIRST-ORDER FORMULAS; PSPACE-COMPLETE; SWITCH STRUCTURE; TERNARY RELATIONS;

COMPUTER CIRCUITS;

EID: 84957037401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_11     Document Type: Conference Paper

References (7)

1. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995). 159, 161
2. E. Pezzoli. On the computational complexity of type-two functionals and logical games on finite structures. Ph.D thesis. Stanford University. June 1998. 160, 162, 169
3. E. Pezzoli Classical and paramteric complexity of logical games. In preparation. 160
4. M. Grohe. Equivalence in finite-variable logics is complete for polynomial time. Proceeding FOCS 96. 159, 164
5. N. Immerman, D. Kozen. Definability with a bounded number of variables. Information and Computation vol 83 (1989) pp. 121-139. 164
6. J. Kobler, U. Schoning,J. Torán. The Graph Isomorphism Problem. Birkhauser 1993. 160
7. L. J. Stockmeyer and A. R. Meyer Word problems requiring exponential time. Fifth Annual ACM Symposium on theory of computing. pp. 1-9, Association for Computing Machinery, New york, 1973. 162