Descriptive Complexity Theory over the Real Numbers (1996)

by Erich Grädel , Klaus Meer
Venue:LECTURES IN APPLIED MATHEMATICS
Citations:25 - 8 self

Active Bibliography

9 Tailoring Recursion for Complexity – Erich Grädel, Yuri Gurevich - 1995
3 Computing on Structures – Serge Abiteboul, Victor Vianu
26 A survey on real structural complexity theory – C. Michaux - 1997
36 Feasible Computation through Model Theory – Anuj Dawar - 1993
36 Fixpoint Logics, Relational Machines, and Computational Complexity – Serge Abiteboul, Moshe Y. Vardi, Victor Vianu - 1993
A Perspective on Lindström Quantifiers and Oracles – Iain A. Stewart
Descriptive Complexity of Optimization and Counting Problems – Madhukar Narayan Thakur - 1992
4 Counting and Addition cannot express Deterministic Transitive Closure – Matthias Ruhl - 1999
14 How to Define a Linear Order on Finite Models – Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto - 1997
20 Finite-Model Theory - A Personal Perspective – Ronald Fagin - 1993
4 Δ-Languages for Sets and LOGSPACE Computable Graph Transformers – Alexei Lisitsa, Vladimir Sazonov - 1997
Δ-Languages for Sets and LOGSPACE Computable Graph Transformers – Alexei Lisitsa, Vladimir Sazonov - 1997
6 On the expressive power of simply typed and let-polymorphic lambda calculi – Gerd Hillebrand, Paris Kanellakis - 1996
1 Generalized Quantifiers for Simple Properties – Martin Otto - 1994
75 Toward Logic Tailored for Computational Complexity – Yuri Gurevich - 1984
17 Local Normal Forms for First-Order Logic with Applications to Games and Automata – Thomas Schwentick, Klaus Barthelmann - 1998
3 Definability on Finite Structures and the Existence of One-Way Functions – Erich Grädel - 1993
63 Metafinite model theory – Yuri Gurevich - 1998
16 A Query Language for NC – Dan Suciu, Val Tannen - 1994