Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games.
Baris AydinliogluDieter van MelkebeekPublished in: Electron. Colloquium Comput. Complex. (2012)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- high speed
- branch and bound algorithm
- computer games
- game theoretic
- game design
- upper and lower bounds
- lower and upper bounds
- video games
- analog circuits
- optimal solution
- circuit design
- lower bounding
- optimal cost
- serious games
- educational games
- electronic circuits
- game theory
- analog vlsi
- set of randomly generated instances
- digital circuits
- finite automata
- finite state
- nash equilibrium
- worst case
- online algorithms
- quadratic assignment problem
- vc dimension
- game play
- delay insensitive
- np hard