The computational complexity of propositional STRIPS planning (Q1337679)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 683692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of propositional STRIPS planning |
scientific article; zbMATH DE number 683692 |
Statements
The computational complexity of propositional STRIPS planning (English)
0 references
19 September 1995
0 references
computational complexity
0 references
STRIPS planning
0 references
0 references
0 references
0.9122971892356871
0 references
0.8675748109817505
0 references
0.8633431196212769
0 references
0.8633431196212769
0 references
