Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression.
Swastik KoppartySrikanth SrinivasanPublished in: Theory Comput. (2018)
Keyphrases
- lower bound
- analog circuits
- circuit design
- tunnel diode
- electronic circuits
- logic circuits
- logic synthesis
- analog vlsi
- delay insensitive
- high speed
- digital circuits
- power reduction
- upper bound
- power dissipation
- image compression
- cmos technology
- branch and bound
- shift register
- branch and bound algorithm
- data compression
- lower and upper bounds
- np hard
- vlsi circuits
- vc dimension
- compression scheme
- compression ratio
- chip design
- objective function
- optimal solution
- fault diagnosis
- power consumption
- compression algorithm
- low power
- sample complexity
- linear programming relaxation
- worst case
- arc consistency
- low voltage
- upper and lower bounds
- online algorithms
- min sum
- optimal cost
- lossless compression
- random access
- online learning
- search space