Parameterising the complexity of planning by the number of paths in the domain-transition graphs (Q5282951)
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 6747862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterising the complexity of planning by the number of paths in the domain-transition graphs |
scientific article; zbMATH DE number 6747862 |
Statements
18 July 2017
0 references
0.8017732501029968
0 references
0.8005324602127075
0 references
0.7967941164970398
0 references
0.7940967082977295
0 references
0.7848258018493652
0 references
