Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP.
Cody MurrayR. Ryan WilliamsPublished in: Electron. Colloquium Comput. Complex. (2017)
Keyphrases
- lower bound
- np hard
- upper bound
- branch and bound algorithm
- objective function
- randomly generated problems
- worst case
- branch and bound
- np complete
- analog circuits
- digital circuits
- optimal solution
- high speed
- vc dimension
- quadratic assignment problem
- johnson lindenstrauss
- upper and lower bounds
- lower and upper bounds
- finite state
- knowledge compilation
- finite automata
- search algorithm
- truth table
- neural network