Revisiting the complexity of and/or graph solution (Q394337)
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: Revisiting the complexity of and/or graph solution |
scientific article; zbMATH DE number 6250591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting the complexity of and/or graph solution |
scientific article; zbMATH DE number 6250591 |
Statements
Revisiting the complexity of and/or graph solution (English)
0 references
27 January 2014
0 references
and/or graphs
0 references
computational complexity
0 references
fixed parameter tractability
0 references
NP-hardness
0 references
W[1]-hardness
0 references
W[2]-hardness
0 references
0 references
0.8370136022567749
0 references
0.7568385601043701
0 references
0.7568385601043701
0 references
