Abstract | ||
---|---|---|
This talk reviews recent developments in algebraic complexitytheory. It outlines some major results concerning structure,completeness, closure, and lower bounds. It describes some techniquesthat have been central to obtaining these results, including extremedepth reduction, partial derivatives, and padding. |
Year | Venue | Field |
---|---|---|
2017 | CSL | Arithmetic circuits,Discrete mathematics,Algebra,Computer science,Partial derivative,Algebraic complexity,Padding,Completeness (statistics) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Meena Mahajan | 1 | 688 | 56.90 |