On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.
Peter BürgisserPublished in: STACS (2007)
Keyphrases
- lower bound
- floating point
- upper bound
- branch and bound algorithm
- high speed
- branch and bound
- lower and upper bounds
- optimal solution
- objective function
- lower level
- set of randomly generated instances
- electronic circuits
- circuit design
- worst case
- np hard
- vc dimension
- quadratic assignment problem
- linear programming relaxation
- micron cmos
- randomly generated problems
- analog circuits
- arithmetic operations
- user defined
- upper and lower bounds
- sample complexity
- lower bounding
- higher level
- hierarchical structure