> Details

Kayal, Neeraj [Author]; Saha, Chandan [Author]; Tavenas, Sébastien [Author] ; Neeraj Kayal and Chandan Saha and Sébastien Tavenas [Contributor]

An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits
  • Contributor: Kayal, Neeraj [Author]; Saha, Chandan [Author]; Tavenas, Sébastien [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.ICALP.2016.33
  • Keywords: depth-3 circuits ; arithmetic circuits ; shifted partials
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We show an almost cubic lower bound on the size of any depth three arithmetic circuit computing an explicit multilinear polynomial in n variables over any field. This improves upon the previously known quadratic lower bound by Shpilka and Wigderson [CCC, 1999].
  • Access State: Open Access