Polynomial queries to relational data bases (Q1067795)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3930381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial queries to relational data bases |
scientific article; zbMATH DE number 3930381 |
Statements
Polynomial queries to relational data bases (English)
0 references
1985
0 references
A language is described, in which it is possible to express exactly all queries computable on a deterministic Turing machine in a time polynomial with respect to the volume of input data.
0 references
deterministic Turing machine
0 references
0.8437856435775757
0 references
0.7899836301803589
0 references
0.7844536304473877
0 references
0.781997561454773
0 references
