Fixpoint Logics, Relational Machines, and Computational Complexity (1993)

Cached

Download Links

by Serge Abiteboul , Moshe Y. Vardi , Victor Vianu
Venue:In Structure and Complexity
Citations:37 - 5 self

Documents Related by Co-Citation

118 Generic computation and its complexity – Serge Abiteboul, Victor Vianu - 1991
271 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
244 Structure and Complexity of Relational Queries – Ashok Chandra, David Harel - 1982
530 The complexity of relational query languages – M Y Vardi - 1982
64 On Moschovakis Closure Ordinals – J Barwise - 1977
152 Datalog extensions for database queries and updates – S Abiteboul, V Vianu - 1991
80 Fixed-point extensions of first-order logic – Y Gurevich, S Shelah - 1986
56 Infinitary Logic and Inductive Definability over Finite Structures – Anuj Dawar, Steven Lindell, Scott Weinstein - 1995
230 Languages That Capture Complexity Classes – Neil Immerman - 1987
153 Logic and the Challenge of Computer Science – Yuri Gurevich - 1988
135 An Optimal Lower Bound on the Number of Variables for Graph Identification – Jin-yi Cai, Neil Immerman, Martin F├╝rer - 1992
84 Computable Queries for Relational Databases – Ashok Chandra, Asok K. Cadm, David Harel - 1980
75 Toward Logic Tailored for Computational Complexity – Yuri Gurevich - 1984
3836 J.D.: Introduction to automata theory, languages, and computation – J E Hopcroft, R Motwani, Ullman
52 Computing With First-Order Logic – Serge Abiteboul, Victor Vianu - 1995
270 Generalized first-order spectra and polynomial-time recognizable sets – Ronald Fagin - 1974
36 Feasible Computation through Model Theory – Anuj Dawar - 1993
10922 Computers and Intractability : A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
55 Theory of database queries – A Chandra - 1988