Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata.
Orna KupfermanNir PitermanPublished in: FoSSaCS (2009)
Keyphrases
- lower bound
- turing machine
- upper bound
- branch and bound
- objective function
- np hard
- cellular automata
- branch and bound algorithm
- finite automata
- optimal solution
- probabilistic automata
- lower and upper bounds
- finite state machines
- upper and lower bounds
- concept class
- lower bounding
- worst case
- sample complexity
- vc dimension
- max sat
- regular expressions
- quadratic assignment problem
- tree automata
- information gain
- randomly generated problems
- poor quality
- optimal cost