Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games.
Baris AydinliogluDieter van MelkebeekPublished in: Computational Complexity Conference (2012)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- game theory
- computer games
- branch and bound
- optimal solution
- lower and upper bounds
- vc dimension
- game theoretic
- finite automata
- video games
- high speed
- np hard
- game design
- circuit design
- lower bounding
- educational games
- digital circuits
- nash equilibria
- quadratic assignment problem
- electronic circuits
- analog vlsi
- upper and lower bounds
- game playing
- finite state
- nash equilibrium
- game play
- coalitional games
- board game
- analog circuits
- perfect information
- sample size
- worst case