Algorithms and conditional lower bounds for planning problems (Q2238604)
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: Algorithms and conditional lower bounds for planning problems |
scientific article; zbMATH DE number 7418627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and conditional lower bounds for planning problems |
scientific article; zbMATH DE number 7418627 |
Statements
Algorithms and conditional lower bounds for planning problems (English)
0 references
2 November 2021
0 references
graph games
0 references
conditional lower bounds
0 references
adversarial planning
0 references
strong exponential time hypothesis
0 references
probabilistic planning
0 references
0 references
0 references
0 references
0 references
0.7480165958404541
0 references
0.725055992603302
0 references
0.7246490120887756
0 references
0.7226938605308533
0 references
0.720060408115387
0 references
