Lower bounds for circuits with MOD_m gates.
Arkadev ChattopadhyayNavin GoyalPavel PudlákDenis ThérienPublished in: FOCS (2006)
Keyphrases
- lower bound
- logic circuits
- upper bound
- low power
- tunnel diode
- np hard
- branch and bound
- branch and bound algorithm
- high speed
- optimal solution
- lower and upper bounds
- delay insensitive
- upper and lower bounds
- logic synthesis
- vc dimension
- worst case
- objective function
- quadratic assignment problem
- lower bounding
- optimal cost
- electronic circuits
- quantum computing
- power consumption
- neural network
- vlsi circuits
- similarity measure
- high level synthesis
- analog vlsi
- scheduling problem
- digital circuits
- linear programming relaxation
- max sat
- sample complexity