The complexity of embedded axiomatization for a class of closed database views (Q2502159)
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: The complexity of embedded axiomatization for a class of closed database views |
scientific article; zbMATH DE number 5052995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of embedded axiomatization for a class of closed database views |
scientific article; zbMATH DE number 5052995 |
Statements
The complexity of embedded axiomatization for a class of closed database views (English)
0 references
12 September 2006
0 references
database
0 references
complexity
0 references
view
0 references
0 references
0 references
0.9128870368003844
0 references
0.8096997141838074
0 references
0.7948412895202637
0 references
