On Lower Bounds for the Depth of Threshold Circuits with Weights from {-1, 0, +1}.
Andreas Alexander AlbrechtPublished in: GOSLER Final Report (1995)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound
- weighted sum
- branch and bound algorithm
- depth information
- lower and upper bounds
- relative importance
- depth map
- high speed
- linear combination
- delay insensitive
- worst case
- high level synthesis
- logic synthesis
- randomly generated problems
- digital circuits
- optimal solution
- np hard
- quadratic assignment problem
- circuit design
- analog circuits
- asynchronous circuits
- linear programming relaxation
- image sequences
- analog vlsi