Exponential lower bounds for depth three Boolean circuits.
Ramamohan PaturiMichael E. SaksFrancis ZanePublished in: Comput. Complex. (2000)
Keyphrases
- lower bound
- upper bound
- average case complexity
- objective function
- branch and bound algorithm
- depth map
- branch and bound
- depth information
- np hard
- worst case
- high speed
- real valued
- boolean functions
- boolean queries
- depth images
- truth table
- randomly generated problems
- lower and upper bounds
- digital circuits
- upper and lower bounds
- analog circuits
- optimal cost
- delay insensitive
- range queries
- neural network