The minimum-length generator sequence problem is NP-hard (Q3920644)
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 3733261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum-length generator sequence problem is NP-hard |
scientific article; zbMATH DE number 3733261 |
Statements
The minimum-length generator sequence problem is NP-hard (English)
0 references
1981
0 references
