PTIME queries revisited

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

Volumn 3363 LNCS, Issue , 2005, Pages 274-288

  Nash, Alan ^a   Remmel, Jeff ^a   Vianu, Victor ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY STRUCTURES; BUILDING BLOCKES; DATABASE QUERY LANGUAGE; OPEN PROBLEMS; QUERY PROCESSOR;

GENE EXPRESSION; LINGUISTICS;

QUERY LANGUAGES;

EID: 70350617360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_19     Document Type: Conference Paper

References (12)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of databases. Addison Wesley, 1995.
2. A. Blass, Y. Gurevich, and S. Shelah. Choiceless polynomial time. Annals of Pure and Applied Logic, 100:141-187, 1999.
3. A. Chandra and D. Harel. Structure and complexity of relational queries. J. Comput. Syst. Sci., 25(1):99-128, 1982.
4. A. Dawar and L. Hella. The expressive power of finitely many generalized quantifiers. Inf. Comput., 123(2):172-184, 1995.
5. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2nd edition, 1999.
6. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. Karp, editor, Complexity of Computation, pages 43-73. SIAM-AMS Proceedings, 1974.
7. M. Grohe. The structure of fixed-point logics. PhD thesis, Albert-Ludwigs Universität Freiburg, 1994.
8. M. Grohe. Fixed-point logics on planar graphs. In Proc. Symp. on Logic in Computer Science, 1998.
9. Y. Gurevich. Logic and the challenge of computer science. In E. Borger, editor, Trends in Theoretical Computer Science, pages 1-57. Computer Science Press, 1988.
10. J. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison Wesley, 1979.
11. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86-104, 1986.
12. M. Y. Vardi. The complexity of relational query languages. In Proc. ACM SIGACT Symp. on the Theory of Computing, pages 137-146, 1982.