The Minimum-Length Generator Sequence Problem is NP-Hard

Shimon Even, Oded Goldreich. The Minimum-Length Generator Sequence Problem is NP-Hard. J. Algorithms, 2(3):311-313, 1981.

Authors

Shimon Even

This author has not been identified. Look up 'Shimon Even' in Google

Oded Goldreich

This author has not been identified. Look up 'Oded Goldreich' in Google