Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
Wojciech CzerwinskiLaure DaviaudNathanaël FijalkowMarcin JurdzinskiRanko LazicPawel ParysPublished in: CoRR (2018)
Keyphrases
- lower bound
- tree automata
- upper bound
- turing machine
- decision trees
- finite automata
- game tree
- branch and bound algorithm
- branch and bound
- objective function
- average case complexity
- error correction
- cellular automata
- finite state
- np hard
- regular expressions
- lower and upper bounds
- game theory
- computer games
- nash equilibria
- game theoretic
- game playing
- nash equilibrium
- worst case
- game play
- tree structure
- statistical queries
- video games
- tree languages
- optimal solution
- finite state machines
- digital games
- serious games
- linear programming relaxation