Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
Wojciech CzerwinskiLaure DaviaudNathanaël FijalkowMarcin JurdzinskiRanko LazicPawel ParysPublished in: SODA (2019)
Keyphrases
- lower bound
- tree automata
- turing machine
- upper bound
- finite automata
- computer games
- branch and bound
- decision trees
- cellular automata
- branch and bound algorithm
- objective function
- lower and upper bounds
- game tree
- tree structure
- worst case
- np hard
- video games
- nash equilibrium
- game play
- error correction
- finite state
- optimal cost
- nash equilibria
- average case complexity
- game theoretic
- game playing
- finite state machines
- game design
- regular expressions
- game theory
- educational games
- data structure