Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract)
Allan BorodinWalter L. RuzzoMartin TompaPublished in: STOC (1989)
Keyphrases
- lower bound
- fixed length
- upper bound
- arbitrary length
- hidden markov models
- variable length
- branch and bound
- finite alphabet
- branch and bound algorithm
- worst case
- data structure
- lower and upper bounds
- optimal solution
- objective function
- neural network
- np hard
- vc dimension
- high level
- tree structure
- error bounds
- maximum number
- linear programming relaxation