On the complexity of deciding typability in the relational algebra (Q1777227)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding typability in the relational algebra |
scientific article |
Statements
On the complexity of deciding typability in the relational algebra (English)
0 references
12 May 2005
0 references
non-uniform constraint satisfaction
0 references
