Polynomial time ultrapowers and the consistency of circuit lower bounds.
Jan BydzovskyMoritz MüllerPublished in: Arch. Math. Log. (2020)
Keyphrases
- lower bound
- worst case
- upper bound
- min sum
- branch and bound
- objective function
- high speed
- branch and bound algorithm
- np hard
- special case
- upper and lower bounds
- approximation algorithms
- truth table
- randomized algorithm
- lower bounding
- analog circuits
- statistical queries
- computational complexity
- linear programming relaxation
- lower and upper bounds
- integrality gap
- constant factor
- optimal cost
- electronic circuits
- analog vlsi
- max sat
- delay insensitive
- randomly generated problems
- vc dimension
- optimal solution