On the computational complexity of querying bounds on differences constraints (Q1855216): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0004-3702(95)00008-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978078190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constraint propagation with interval labels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Temporal constraint networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The logic of constraint satisfaction / rank | |||
Normal rank | |||
Latest revision as of 12:14, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of querying bounds on differences constraints |
scientific article |
Statements
On the computational complexity of querying bounds on differences constraints (English)
0 references
4 February 2003
0 references
