Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP.
Cody MurrayR. Ryan WilliamsPublished in: STOC (2018)
Keyphrases
- lower bound
- np hard
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- computational complexity
- finite state
- circuit design
- worst case
- lower bounding
- scheduling problem
- high speed
- np complete
- optimal solution
- electronic circuits
- lower and upper bounds
- quadratic assignment problem
- johnson lindenstrauss
- analog vlsi
- analog circuits
- linear programming relaxation
- upper and lower bounds
- vc dimension
- genetic algorithm
- linear programming
- low cost