Exponential Lower Bounds for Depth 3 Boolean Circuits.
Ramamohan PaturiMichael E. SaksFrancis ZanePublished in: STOC (1997)
Keyphrases
- lower bound
- upper bound
- average case complexity
- branch and bound algorithm
- depth map
- real valued
- objective function
- branch and bound
- np hard
- high speed
- boolean functions
- lower and upper bounds
- depth information
- worst case
- vc dimension
- upper and lower bounds
- analog circuits
- decision diagrams
- delay insensitive
- optimal solution
- depth images
- lower bounding
- optimal cost
- logic synthesis
- analog vlsi