Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity.
Michael A. ForbesMrinal KumarRamprasad SaptharishiPublished in: Computational Complexity Conference (2016)
Keyphrases
- lower bound
- high speed
- worst case
- analog circuits
- circuit design
- analog vlsi
- delay insensitive
- logic circuits
- digital circuits
- logic synthesis
- upper bound
- electronic circuits
- tunnel diode
- power reduction
- objective function
- shift register
- computational complexity
- upper and lower bounds
- low power
- vlsi circuits
- power dissipation
- lower and upper bounds
- power consumption
- truth table
- average case complexity
- cmos technology
- optimal cost
- multi valued
- real valued
- branch and bound
- np hard