Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223)
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 6677860
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Refining complexity analyses in planning by exploiting the exponential time hypothesis |
scientific article; zbMATH DE number 6677860 |
Statements
Refining complexity analyses in planning by exploiting the exponential time hypothesis (English)
0 references
25 January 2017
0 references
action planning
0 references
computational complexity
0 references
lower bounds
0 references
upper bounds
0 references
exponential time hypothesis
0 references
0 references
0.9499219
0 references
0.8815251
0 references
0.8803671
0 references
0.87815905
0 references
0.87078345
0 references
0 references
0.86484337
0 references
0.8613844
0 references
0.86072814
0 references
