Queries with arithmetical constraints
- 1 February 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 173 (1) , 151-181
- https://doi.org/10.1016/s0304-3975(96)00194-6
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Finite-model theory - a personal perspectiveTheoretical Computer Science, 1993
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960