"The Minimum-Length Generator Sequence Problem is NP-Hard."

Shimon Even, Oded Goldreich (1981)

> Home

Details and statistics

DOI: 10.1016/0196-6774(81)90029-8

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/EvenG81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/EvenG81
Shimon Even, Oded Goldreich:
The Minimum-Length Generator Sequence Problem is NP-Hard. J. Algorithms 2(3): 311-313 (1981)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.