The complexity of evaluating relational queries (Q3334110)
From MaRDI portal
!
WARNING
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 3866612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of evaluating relational queries |
scientific article; zbMATH DE number 3866612 |
Statements
The complexity of evaluating relational queries (English)
0 references
1983
0 references
relational database
0 references
relational expression
0 references
polynomial transformation
0 references
completeness
0 references
hardness
0 references
enumeration problem
0 references
polynomial-time hierarchy
0 references
evaluation of relational queries
0 references
NP
0 references
co-NP
0 references
0.8097625970840454
0 references
0.8077830672264099
0 references
0.8012514114379883
0 references
0.796244740486145
0 references
0.7948140501976013
0 references
