Simple and tight complexity lower bounds for solving Rabin games.
Antonio CasaresMarcin PilipczukMichal PilipczukUéverton S. SouzaK. S. ThejaswiniPublished in: CoRR (2023)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound
- np hard
- branch and bound algorithm
- lower bounding
- space complexity
- exact solution
- average case complexity
- game theory
- quadratic assignment problem
- lower and upper bounds
- nash equilibrium
- finding optimal solutions
- average case
- upper and lower bounds
- game theoretic
- objective function
- error bounds
- computational complexity