Login / Signup

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

Shimon EvenOded Goldreich
Published in: J. Algorithms (1981)
Keyphrases
  • minimum length
  • np hard
  • pseudorandom
  • shortest path
  • optimal solution
  • special case
  • genetic algorithm
  • objective function
  • lower bound
  • least squares
  • digital curves