Name
Year | DOI | Venue |
|---|---|---|
2014 | 10.4230/LIPIcs.STACS.2014.28 | Leibniz International Proceedings in Informatics |
Keywords | Field | DocType |
Circuit complexity,arithmetic circuits,lower bounds,polynomial identity testing | Discrete mathematics,Polynomial identity testing,Combinatorics,Polynomial,Computer science,Arbitrary-precision arithmetic,Affine arithmetic,Saturation arithmetic,Arithmetic circuit complexity,Symmetric polynomial,Geometric complexity theory | Conference |
Volume | ISSN | Citations |
25 | 1868-8969 | 1 |
PageRank | References | Authors |
0.35 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neeraj Kayal | 1 | 263 | 19.39 |