An Improved Lower Bound for Depth four Arithmetic Circuits
We study the problem of proving lower bounds for depth four arithmetic circuits. Depth four circuits have been receiving much attraction when it comes to recent circuit lower bound results, as a result of the series of results culminating in the fact that strong enough lower bounds for depth four ci...
Main Author: | Sharma, Abhijat |
---|---|
Other Authors: | Saha, Chandan |
Language: | en_US |
Published: |
2018
|
Subjects: | |
Online Access: | http://etd.iisc.ernet.in/2005/3637 http://etd.iisc.ernet.in/abstracts/4507/G28453-Abs.pdf |
Similar Items
-
Towards a Charcterization of the Symmetries of the Nisan-Wigderson Polynomial Family
by: Gupta, Nikhil
Published: (2018) -
The size and depth of Boolean circuits
by: Jang, Jing-Tang Keith
Published: (2013) -
New Circuit Minimization Techniques for Smaller and Faster AES SBoxes
by: Alexander Maximov, et al.
Published: (2019-08-01) -
MSB First Arithmetic Circuit for Motion Estimation
by: Bashir, Zeeshan Ahmed
Published: (2015) -
Estudo e implementação de somador com detecção de fim de cálculo para circuitos assíncronos
by: Sartori, Giovani Heriberto
Published: (2008)