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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.