The complexity of finding minimum-length generator sequences
- 1 January 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 36, 265-289
- https://doi.org/10.1016/0304-3975(85)90047-7
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The minimum-length generator sequence problem is NP-hardJournal of Algorithms, 1981
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970