The complexity of relational query languages (Extended Abstract)
Author:
- Moshe Y. VardiMVMoshe Y. Vardi
Open Access
- 5 May 1982
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 137-146
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Structure and complexity of relational queries1980
- On the expressive power of the relational algebraInformation Processing Letters, 1978
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- On two-way multihead automataJournal of Computer and System Sciences, 1973
- Reducibility among Combinatorial Problems1972
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965