Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games.
Baris AydinliogluDieter van MelkebeekPublished in: Comput. Complex. (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- branch and bound algorithm
- video games
- computer games
- lower and upper bounds
- game theory
- high speed
- upper and lower bounds
- nash equilibrium
- game theoretic
- game playing
- worst case
- finite automata
- nash equilibria
- analog circuits
- np hard
- lower bounding
- serious games
- vc dimension
- analog vlsi
- initial state
- circuit design
- game design
- online algorithms
- optimal solution
- learning algorithm
- logic circuits
- multi agent
- set of randomly generated instances