Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems.
Lijie ChenDylan M. McKayCody D. MurrayR. Ryan WilliamsPublished in: Computational Complexity Conference (2019)
Keyphrases
- lower bound
- upper bound
- objective function
- high speed
- branch and bound
- connected components
- branch and bound algorithm
- semantic relations
- circuit design
- np hard
- lower and upper bounds
- delay insensitive
- quadratic assignment problem
- relational algebra
- spatial relations
- worst case
- data model
- database
- analog vlsi
- np hard problems
- analog circuits
- neural network