The complexity of querying indefinite data about linearly ordered domains (Q676427)
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 querying indefinite data about linearly ordered domains |
scientific article; zbMATH DE number 992432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of querying indefinite data about linearly ordered domains |
scientific article; zbMATH DE number 992432 |
Statements
The complexity of querying indefinite data about linearly ordered domains (English)
0 references
18 March 1997
0 references
partial order
0 references
query answering
0 references
PTIME subproblems
0 references
0.7713027000427246
0 references
0.763129711151123
0 references
