Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates.
Frederic GreenPublished in: STACS (1995)
Keyphrases
- lower bound
- logic circuits
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- upper and lower bounds
- high speed
- np hard
- depth information
- vc dimension
- objective function
- quadratic assignment problem
- worst case
- depth map
- lower bounding
- optimal cost
- randomly generated problems
- high level synthesis
- delay insensitive
- tunnel diode
- max sat
- low power
- combinatorial optimization
- linear programming
- special case