Parameterized complexity and kernel bounds for hard planning problems (Q4924634)
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: Parameterized complexity and kernel bounds for hard planning problems |
scientific article; zbMATH DE number 6171991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity and kernel bounds for hard planning problems |
scientific article; zbMATH DE number 6171991 |
Statements
Parameterized Complexity and Kernel Bounds for Hard Planning Problems (English)
0 references
7 June 2013
0 references
0.9135800004005432
0 references
0.7967941164970398
0 references
0.7913638353347778
0 references
0.7680185437202454
0 references
