Strong bounds on the approximability of two Pspace-hard problems in propositional planning (Q1978020)
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: Strong bounds on the approximability of two Pspace-hard problems in propositional planning |
scientific article; zbMATH DE number 1456919
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong bounds on the approximability of two Pspace-hard problems in propositional planning |
scientific article; zbMATH DE number 1456919 |
Statements
Strong bounds on the approximability of two Pspace-hard problems in propositional planning (English)
0 references
7 June 2000
0 references
computational complexity of planning
0 references
