Choiceless polynomial time, counting and the cai-fürer-immerman graphs: (Extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 143, Issue SPEC. ISS., 2006, Pages 13-26

  Dawar, Anuj ^a   Richerby, David ^a   Rossman, Benjamin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Choiceless polynomial time; Counting; Descriptive complexity; Finite model theory

Indexed keywords

COMPUTER PROGRAMMING; FORMAL LANGUAGES; FORMAL LOGIC; POLYNOMIALS; QUERY LANGUAGES;

CHOICELESS POLYNOMIAL TIME; COUNTING; DESCRIPTIVE COMPLEXITY; FINITE MODEL THEORY;

GRAPH THEORY;

EID: 29344446836     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.05.024     Document Type: Conference Paper

References (12)

1. A. Blass, Y. Gurevich, and S. Shelah Choiceless polynomial time Annals of Pure and Applied Logic 100 1999 141 187
2. A. Blass, Y. Gurevich, and S. Shelah On polynomial time computation over unordered structures Journal of Symbolic Logic 67 2002 1093 1125
3. J.-Y. Cai, M. Fürer, and N. Immerman An optimal lower bound on the number of variables for graph identification Combinatorica 12 1992 389 410
4. A. Dawar, and D.M. Richerby A fixed-point logic with symmetric choice Proc. 17th Workshop on Comp. Sci. Logic LNCS 2803 2003 169 182
5. H.-D. Ebbinghaus, and J. Flum Finite Model Theory 2nd edition 1999 Springer
6. R. Fagin Generalized first-order spectra and polynomial-time recognizable sets R.M. Karp Complexity of Computation SIAM-AMS Proceedings 7 1974 43 73
7. F. Gire, and H. Hoang An extension of fixpoint logic with a symmetry-based choice construct Information and Computation 144 1998 40 65
8. E. Grädel, and M. Otto Inductive definability with counting on finite structures Selected papers from 6th Workshop on Computer Science Logic LNCS 702 1993 231 247
9. L. Hella Logical hierarchies in PTIME Information and Computation 129 1996 1 19
10. N. Immerman Relational queries computable in polynomial time Information and Control 68 1986 86 104
11. N. Immerman Descriptive Complexity 1999 Springer
12. Vardi, M.Y., The complexity of relational query languages, in: Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 137-146