The complexity of querying indefinite data about linearly ordered domains (Q676427): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jcss.1997.1455 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCSS.1997.1455 / rank | |||
Normal rank | |||
Revision as of 06:55, 9 December 2024
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
