A new lower bound on the family complexity of Legendre sequences.
Yagmur ÇakirogluOguz YaylaPublished in: Appl. Algebra Eng. Commun. Comput. (2022)
Keyphrases
- lower bound
- worst case
- upper bound
- special case
- branch and bound algorithm
- objective function
- branch and bound
- computational complexity
- sequential patterns
- complexity analysis
- optimal solution
- average case complexity
- polynomial approximation
- competitive ratio
- computational cost
- differential equations
- upper and lower bounds
- decision problems
- hidden markov models