Top-Down Lower Bounds for Depth-Three Circuits.
Johan HåstadStasys JuknaPavel PudlákPublished in: Comput. Complex. (1995)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- high speed
- branch and bound
- lower and upper bounds
- worst case
- np hard
- depth map
- lower bounding
- high level
- upper and lower bounds
- optimal cost
- randomly generated problems
- electronic circuits
- delay insensitive
- analog vlsi
- vc dimension
- sample size
- theoretical analysis
- low cost
- special case
- optimal solution
- high quality