| dc.contributor.author | Kayal, Neeraj | |
| dc.contributor.author | Saraf, Shubhangi | |
| dc.date.accessioned | 2010-10-20T20:25:16Z | |
| dc.date.available | 2010-10-20T20:25:16Z | |
| dc.date.issued | 2010-03 | |
| dc.date.submitted | 2009-10 | |
| dc.identifier.isbn | 978-1-4244-5116-6 | |
| dc.identifier.issn | 0272-5428 | |
| dc.identifier.other | INSPEC Accession Number: 11207145 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/59436 | |
| dc.description.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). | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Award CCF 0829672) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1109/FOCS.2009.67 | en_US |
| dc.rights | 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. | en_US |
| dc.source | IEEE | en_US |
| dc.subject | Arithmetic circuits | en_US |
| dc.subject | Derandomization | en_US |
| dc.subject | Sylvester–Gallai Theorem | en_US |
| dc.title | Blackbox polynomial identity testing for depth 3 circuits | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.approver | Saraf, Shubhangi | |
| dc.contributor.mitauthor | Saraf, Shubhangi | |
| dc.relation.journal | 50th Annual IEEE Symposium on Foundations of Computer Science, 2009. FOCS '09 | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Kayal, Neeraj; Saraf, Shubhangi | en |
| mit.license | PUBLISHER_POLICY | en_US |
| mit.metadata.status | Complete | |
