Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:drops-oai.dagstuhl.de:6312

An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits

Authors
Publication date
1 January 2016
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Doi

    Abstract

    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]

    Similar works

    Full text

    thumbnail-image

    Dagstuhl Research Online Publication Server

    redirect
    oaioai:drops-oai.dagstuhl.de:6312
    Last time updated on 17/11/2016

    This paper was published in Dagstuhl Research Online Publication Server.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.