On the complexity of deciding typability in the relational algebra (Q1777227): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:41, 5 March 2024
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
