Blackbox polynomial identity testing for depth 3 circuits
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).
Main Authors: | Kayal, Neeraj (Author), Saraf, Shubhangi (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2010-10-20T20:25:16Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Blackbox Reconstruction of Depth Three Circuits with Top Fan-In Two
by: Sinha, Gaurav
Published: (2016) -
Test Case Ordering and Selection for Blackbox Testing
by: Tung-Hsung Yu, et al.
Published: (2012) -
ECall Blackbox - 48
by: de Vreeze, M.
Published: (2010) -
Blackbox-onderzoek veiligheidshuizen - 49
by: Holvast, J.
Published: (2010) -
Apply Ant Colony Optimization to Test Case Prioritization for Blackbox Testing
by: Pei-Qi Wang, et al.
Published: (2011)