Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity.
Michael A. ForbesMrinal KumarRamprasad SaptharishiPublished in: CoRR (2016)
Keyphrases
- lower bound
- high speed
- analog circuits
- circuit design
- delay insensitive
- worst case
- objective function
- upper bound
- digital circuits
- electronic circuits
- logic circuits
- logic synthesis
- power reduction
- shift register
- tunnel diode
- power dissipation
- vlsi circuits
- branch and bound algorithm
- analog vlsi
- branch and bound
- chip design
- truth table
- cmos technology
- power consumption
- asynchronous circuits
- learning algorithm
- lower and upper bounds
- real valued
- computational complexity
- average case complexity