The complexity of querying indefinite data about linearly ordered domains (Q676427): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcss.1997.1455 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031639195 / rank | |||
Normal rank | |||
Revision as of 20:52, 19 March 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
