##
###
Unifying Known Lower Bounds via Geometric Complexity Theory

Joshua A. Grochow

2015
*
Computational Complexity
*

the partial derivatives technique (Nisan-Wigderson), the results *of* Razborov *and* Smolensky *on* AC^0[p], multilinear formula *and* *circuit* size lower *bounds* (Raz et al.), the *degree* *bound* (Strassen, Baur-Strassen ...
This enables us to expose *a* new viewpoint *on* GCT, whereby it is *a* natural unification *and* broad generalization *of* known results. ...
Landsberg, Ketan Mulmuley, Toni Pitassi, Peter Scheiblechner, Chris Umans, Alasdair Urquhart, Ryan Williams, *and* Yiwei She for useful discussions. In particular, Williams suggested the ...

doi:10.1007/s00037-015-0103-x
fatcat:ifoaveduubhmxlokr4pygqzjqq