|
61
|
Metafinite model theory
– Yuri Gurevich
- 1998
|
|
328
|
On a theory of computation and complexity over the real numbers: NP completeness, recursive functions, and universal machines
– L Blum, M Shub, S Smale
- 1989
|
|
431
|
Finite Model Theory
– H D Ebbinghaus, J Flum
- 1999
|
|
318
|
Constraint Query Languages
– Paris C. Kanellakis , Gabriel M. Kuper, Peter Z. Revesz
- 1992
|
|
7
|
Logics Which Capture Complexity Classes Over the Reals
– Felipe Cucker, Klaus Meer
|
|
1950
|
Monotone Complexity
– Michelangelo Grigni , Michael Sipser
- 1990
|
|
264
|
Complexity and real computation
– L Blum, F Cucker, M Shub, S Smale
- 1998
|
|
485
|
The Complexity of Relational Query Languages
– M Vardi
- 1982
|
|
5
|
0-1 laws for recursive structures
– Erich Grädel, Anders Malmström
- 1997
|
|
149
|
Logic and the Challenge of Computer Science
– Yuri Gurevich
- 1988
|
|
19
|
On the power of real Turing machines over binary inputs
– Felipe Cucker, Dima Grigoriev
- 1997
|
|
12
|
On digital nondeterminism
– F Cucker, M Matamala
- 1996
|
|
7
|
On the complexity of quadratic programming in real number models of computation
– K Meer
- 1994
|
|
10
|
Towards a Theory of Recursive Structures
– David Harel
- 1998
|
|
1267
|
Foundations of Databases
– S Abiteboul, R Hull, V Vianu
- 1995
|
|
119
|
An Optimal Lower Bound on the Number of Variables for Graph Identification
– Jin-yi Cai, Neil Immerman, Martin Fürer
- 1992
|
|
24
|
A survey on real structural complexity theory
– C. Michaux
- 1997
|
|
242
|
Generalized first-order spectra and polynomial-time recognizable sets
– R Fagin
- 1974
|
|
22
|
Descriptive Complexity. Graduate Texts
– N Immerman
- 1999
|
