On the complexity of deciding typability in the relational algebra (Q1777227)
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: On the complexity of deciding typability in the relational algebra |
scientific article; zbMATH DE number 2168052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of deciding typability in the relational algebra |
scientific article; zbMATH DE number 2168052 |
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
0.7918490767478943
0 references
0.7531113028526306
0 references
0.7318239212036133
0 references
0.725295901298523
0 references
0.7184075117111206
0 references
