A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton.
Mikhail A. RaskinPublished in: ICALP (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound
- optimal solution
- randomized algorithms
- running times
- polynomial approximation
- branch and bound algorithm
- data sets
- similarity measure
- finite state automaton
- deterministic finite automata
- finite state automata
- black box
- turing machine
- deterministic finite automaton
- randomized algorithm
- constant factor
- sample complexity
- worst case
- np hard
- evolutionary algorithm
- computational complexity
- genetic algorithm