MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Blackbox polynomial identity testing for depth 3 circuits

Author(s)
Kayal, Neeraj; Saraf, Shubhangi
Thumbnail
DownloadKayal-2009-Blackbox polynomial identity testing for depth 3 circuits.pdf (312.3Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
We study EIIE(k) circuits, i.e., depth three arithmetic circuits with top fanin k. We give the first deterministic polynomial time blackbox identity test for EIIE(k) circuits over the field Q of rational numbers, thus resolving a question posed by Klivans and Spielman (STOC 2001).
Date issued
2010-03
URI
http://hdl.handle.net/1721.1/59436
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
50th Annual IEEE Symposium on Foundations of Computer Science, 2009. FOCS '09
Publisher
Institute of Electrical and Electronics Engineers
Citation
Kayal, N., and S. Saraf. “Blackbox Polynomial Identity Testing for Depth 3 Circuits.” Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on. 2009. 198-207. © 2009 Institute of Electrical and Electronics Engineers.
Version: Final published version
Other identifiers
INSPEC Accession Number: 11207145
ISBN
978-1-4244-5116-6
ISSN
0272-5428
Keywords
Arithmetic circuits, Derandomization, Sylvester–Gallai Theorem

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.