Relational queries computable in polynomial time (Q3753525)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relational queries computable in polynomial time |
scientific article; zbMATH DE number 3990913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relational queries computable in polynomial time |
scientific article; zbMATH DE number 3990913 |
Statements
Relational queries computable in polynomial time (English)
0 references
1986
0 references
polynomial time computable queries
0 references
relational calculus
0 references
least fixed point operator
0 references
fixed point query hierarchy
0 references
finite model theory
0 references
0.8437856435775757
0 references
0.8253318667411804
0 references
0.8235434889793396
0 references
0.8216004371643066
0 references
0.8077830672264099
0 references
