A lower bound for a constant in Shallit's conjecture.
Juhani KarhumäkiWojciech PlandowskiFilippo MignosiPublished in: Developments in Language Theory (1997)
Keyphrases
- lower bound
- upper bound
- constant factor
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- arbitrarily close
- objective function
- np hard
- branch and bound
- sufficiently accurate
- lower bounding
- worst case
- upper and lower bounds
- linear programming relaxation
- information retrieval
- branch and bound method
- dynamic programming
- sample complexity
- social networks
- lagrangian relaxation
- machine learning