A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games.
Scott AaronsonBaris AydinliogluHarry BuhrmanJohn M. HitchcockDieter van MelkebeekPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- lower bound
- upper bound
- average case complexity
- branch and bound algorithm
- objective function
- branch and bound
- game theory
- game playing
- optimal solution
- vc dimension
- video games
- computer games
- np hard
- nash equilibria
- average case
- upper and lower bounds
- circuit design
- high speed
- perfect information
- game theoretic
- game design
- online algorithms
- digital circuits
- coalitional games
- worst case
- analog vlsi
- search algorithm
- multi agent systems
- educational games
- nash equilibrium
- quadratic assignment problem
- lower bounding
- electronic circuits
- data structure