Recent progress on lower bounds for arithmetic circuits

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

In recent years there has been much exciting progress on depth reduction of arithmetic circuits and lower bounds for bounded depth arithmetic circuits. We will survey some of these results and highlight some of the main challenges and open questions that remain.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE 29th Conference on Computational Complexity, CCC 2014
PublisherIEEE Computer Society
Pages155-160
Number of pages6
ISBN (Print)9781479936267
DOIs
StatePublished - Jan 1 2014
Event29th Annual IEEE Conference on Computational Complexity, CCC 2014 - Vancouver, BC, Canada
Duration: Jun 11 2014Jun 13 2014

Publication series

NameProceedings of the Annual IEEE Conference on Computational Complexity
ISSN (Print)1093-0159

Other

Other29th Annual IEEE Conference on Computational Complexity, CCC 2014
CountryCanada
CityVancouver, BC
Period6/11/146/13/14

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Computational Mathematics

Keywords

  • arithmetic circuits
  • depth reduction
  • lower bounds

Fingerprint Dive into the research topics of 'Recent progress on lower bounds for arithmetic circuits'. Together they form a unique fingerprint.

Cite this