Name
Abstract | ||
|---|---|---|
In recent years there has been much exciting progress on depth reduction of arithmetic circuits and lower bounds for bounded depth arithmetic circuits. We will survey some of these results and highlight some of the main challenges and open questions that remain. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/CCC.2014.23 | IEEE Conference on Computational Complexity |
Keywords | Field | DocType |
depth reduction,computational complexity,lower bounds,arithmetic circuits,arithmetic circuits, lower bounds, depth reduction,bounded depth arithmetic circuits,polynomials,computational modeling,logic gates,upper bound,testing | Arithmetic circuits,Discrete mathematics,Computer science,Arithmetic circuit complexity,Computational complexity theory,Bounded function | Conference |
ISSN | Citations | PageRank |
1093-0159 | 1 | 0.35 |
References | Authors | |
10 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shubhangi Saraf | 1 | 263 | 24.55 |