Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract) (Q2817636)
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 6621816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract) |
scientific article; zbMATH DE number 6621816 |
Statements
1 September 2016
0 references
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract) (English)
0 references
0.80670565366745
0 references
0.7643061280250549
0 references
0.7625279426574707
0 references
0.7527745366096497
0 references
