Relational queries computable in polynomial time (Q3753525)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relational queries computable in polynomial time |
scientific article |
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
