The complexity of querying indefinite data about linearly ordered domains (Q676427)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of querying indefinite data about linearly ordered domains |
scientific article |
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
