Lower Bounds for the Linear Complexity of Sequences over Residue Rings.
Zong-Duo DaiThomas BethDieter GollmannPublished in: EUROCRYPT (1990)
Keyphrases
- linear complexity
- lower bound
- upper bound
- objective function
- branch and bound algorithm
- hidden markov models
- upper and lower bounds
- np hard
- sequential patterns
- optimal cost
- vc dimension
- optimal solution
- scheduling problem
- lower bounding
- randomly generated problems
- linear programming relaxation
- event sequences
- sequence alignment
- amino acids
- dynamic programming