Log-Concavity and Lower Bounds for Arithmetic Circuits.
Ignacio García-MarcoPascal KoiranSébastien TavenasPublished in: MFCS (2) (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- optimal solution
- worst case
- lower and upper bounds
- upper and lower bounds
- lower bounding
- delay insensitive
- objective function
- high speed
- neural network
- log log
- theoretical analysis
- analog circuits
- arithmetic operations
- optimal cost
- tunnel diode
- linear programming relaxation
- vc dimension
- convex hull
- digital circuits
- circuit design
- floating point