A better lower bound on the family complexity of binary Legendre sequence.

Yagmur Çakiroglu Oguz Yayla

Published in: CoRR (2018)

Keyphrases

lower bound
worst case
upper bound
lower and upper bounds
np hard
branch and bound algorithm
objective function
complexity analysis
space complexity
special case
lower bounding
optimal solution
data structure
computational cost
similarity search
sample complexity