Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
37 | Zohar Shay Karnin, Amir Shpilka |
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 280-291, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
PIT, depth-3, arithmetic circuit, deterministic, polynomial identity testing |
33 | Zeev Dvir, Amir Shpilka |
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 592-601, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
depth 3 circuits, locally decodable codes, polynomial identity testing |
32 | Dmitriy Yu. Cherukhin |
Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 122-133, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
complexity, lower bound, Boolean function, circuit, depth, cyclic convolution |
29 | Dima Grigoriev, Alexander A. Razborov |
Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 10(6), pp. 465-487, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Exponential lower bounds, Depth 3 arithmetic circuits, Finite fields |
29 | Dima Grigoriev, Alexander A. Razborov |
Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 269-278, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
depth 3 arithmetic circuits, exponential lower bounds, approximating by sparse polynomials |
28 | Johan Håstad, Stasys Jukna, Pavel Pudlák |
Top-Down Lower Bounds for Depth 3 Circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 124-129, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
nonmonotone circuits, top-down lower bounds, depth 3 circuits, depth 3 AND-OR-NOT circuits, strong lower bound, top-down argument |
23 | Ran Raz, Iddo Tzameret |
The Strength of Multilinear Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 407-457, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03F20, 68Q17, 13P10 |
23 | Amir Shpilka, Ilya Volkovich |
Read-once polynomial identity testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 507-516, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits |
19 | Amir Shpilka |
Affine Projections of Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 160-171, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Sorin Cotofana, Stamatis Vassiliadis |
Signed Digit Addition and Related Operations with Threshold Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(3), pp. 193-207, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
signed-digit arithmetic, redundant adders, redundant multipliers, neural networks, Computer arithmetic, threshold logic, carry-free addition, signed-digit number representation |
19 | Nitin Saxena 0001 |
Diagonal Circuit Identity Testing and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 60-71, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
identity testing, depth 3, depth 4, lower bounds, determinant, arithmetic circuit, permanent |
18 | Christian Glaßer, Heinz Schmitz |
Languages of Dot-Depth 3/2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 555-566, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Amir Shpilka, Avi Wigderson |
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 87-, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Amir Shpilka |
Interpolation of depth-3 arithmetic circuits with two multiplication gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 284-293, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
depth-3, interpolation, arithmetic circuits, exact learning |
15 | David Buchfuhrer, Christopher Umans |
The Complexity of Boolean Formula Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 24-35, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Sorin Dan Cotofana, Casper Lageweg, Stamatis Vassiliadis |
Addition Related Arithmetic Operations via Controlled Transport of Charge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(3), pp. 243-256, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
single electron technology, electron counting, multiplication, SET, addition |
15 | Satyanarayana V. Lokam |
Graph Complexity and Slice Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(1), pp. 71-88, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Sorin Cotofana, Casper Lageweg, Stamatis Vassiliadis |
On Computing Addition Related Arithmetic Operations via Controlled Transport of Charge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 15-18 June 2003, Santiago de Compostela, Spain, pp. 245-252, 2003, IEEE Computer Society, 0-7695-1894-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | José Fernández Ramos, Alfonso Gago Bohórquez |
Two Operand Binary Adders with Threshold Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 48(12), pp. 1324-1337, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
neural networks, logic design, computer arithmetic, Threshold logic, threshold gate, binary adders |
15 | Claudia Bertram-Kretzberg, Thomas Hofmeister |
Multiple Product Modulo Arbitrary Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 288-298, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
13 | Suryajith Chillara, Partha Mukhopadhyay |
On the limits of depth reduction at depth 3 over small finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 256, pp. 35-44, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Manindra Agrawal, Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 |
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 45(4), pp. 1533-1562, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Sébastien Tavenas |
Improved bounds for reduction to depth 4 and depth 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 240, pp. 2-11, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Suryajith Chillara, Partha Mukhopadhyay |
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1401.0189, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
13 | Suryajith Chillara, Partha Mukhopadhyay |
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS (2) ![In: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, pp. 177-188, 2014, Springer, 978-3-662-44464-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Sébastien Tavenas |
Improved bounds for reduction to depth 4 and depth 3 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.5777, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
13 | Sébastien Tavenas |
Improved Bounds for Reduction to Depth 4 and Depth 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, pp. 813-824, 2013, Springer, 978-3-642-40312-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Manindra Agrawal, Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 |
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pp. 599-614, 2012, ACM, 978-1-4503-1245-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Manindra Agrawal, Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 |
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
13 | Manindra Agrawal, Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 |
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1111.0582, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
12 | Ran Raz |
Tensor-rank and lower bounds for arithmetic formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 659-666, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits |
12 | Emanuele Viola |
On Approximate Majority and Probabilistic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 155-168, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
12 | Alexis Maciel, Denis Thérien |
Threshold Circuits for Iterated Multiplication: Using AC0 for Free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 545-565, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
12 | Sorin Istrail, Dejan Zivkovic |
A Non-Probabilistic Switching Lemma for the Sipser Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 566-575, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
11 | Kai-Yeung Siu, Vwani P. Roychowdhury, Thomas Kailath |
Depth-Size Tradeoffs for Neural Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(12), pp. 1402-1412, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
arithmetic functions, depth-3, parallel computation, Boolean functions, neural nets, size, threshold logic, neural computation, threshold gates, symmetric Boolean functions |
11 | Andrew Chi-Chih Yao |
On ACC and Threshold Circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 619-627, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
ACC, two-level circuits, symmetric-function gate, depth-3 threshold circuits, language, computing power, threshold circuits, AND gates |
10 | Neeraj Kayal, Nitin Saxena 0001 |
Polynomial Identity Testing for Depth 3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(2), pp. 115-138, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
13P99, Subject classification. 68Q15 |
10 | Neeraj Kayal, Nitin Saxena 0001 |
Polynomial Identity Testing for Depth 3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 9-17, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
10 | Richard Beigel, Alexis Maciel |
Upper and Lower Bounds for Some Depth-3 Circuit Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 149-157, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
constant depth, majority gate, MOD gate, inner product mod 2, threshold circuit |
8 | Alexander A. Sherstov |
Separating AC0 from depth-2 majority circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 294-301, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
AC0, communication complexity, discrepancy, threshold circuits |
8 | Adam R. Klivans, Alexander A. Sherstov |
Cryptographic Hardness for Learning Intersections of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 553-562, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
8 | Kei Uchizawa, Rodney J. Douglas, Wolfgang Maass 0001 |
Energy Complexity and Entropy of Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 631-642, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
8 | Ran Raz, Amir Shpilka |
Deterministic polynomial identity testing in non-commutative models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(1), pp. 1-19, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification |
8 | Ran Raz, Amir Shpilka |
Deterministic Polynomial Identity Testing in Non-Commutative Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 215-222, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
8 | Matthias Krause 0001 |
On Realizing Iterated Multiplication by Small Depth Threshold Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 83-94, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
8 | Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon |
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 130-139, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
8 | Dima Grigoriev, Marek Karpinski |
A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993, Proceedings, pp. 162-169, 1993, Springer, 3-540-56686-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
6 | Tameem Choudhury, Karteek Sreenivasaiah |
Depth-3 Circuit Lower Bounds for k-OV. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 25:1-25:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
6 | Mika Göös, Ziyi Guan, Tiberiu Mosnoi |
Depth-3 Circuits for Inner Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
6 | Tameem Choudhury, Karteek Sreenivasaiah |
Depth-3 Circuit Lower Bounds for k-OV. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
6 | Mika Göös, Ziyi Guan, Tiberiu Mosnoi |
Depth-3 Circuits for Inner Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, pp. 51:1-51:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-292-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
6 | Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye |
On depth-3 circuits and covering number: an explicit counter-example. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.08300, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
6 | Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard |
A Variant of the VC-Dimension with Applications to Depth-3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 72:1-72:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
6 | Pranjal Dutta, Nitin Saxena 0001 |
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pp. 200-211, 2022, IEEE, 978-1-6654-5519-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
6 | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
6 | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.01751, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
6 | Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard |
A Variant of the VC-dimension with Applications to Depth-3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.09671, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
6 | Pranjal Dutta, Prateek Dwivedi 0001, Nitin Saxena 0001 |
Demystifying the border of depth-3 algebraic circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 92-103, 2021, IEEE, 978-1-6654-2055-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
6 | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 809-822, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
6 | Mrinal Kumar 0001 |
On the Power of Border of Depth-3 Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 12(1), pp. 5:1-5:8, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
6 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
6 | Mrinal Kumar 0001 |
On top fan-in vs formal degree for depth-3 arithmetic circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
6 | Mrinal Kumar 0001 |
On top fan-in vs formal degree for depth-3 arithmetic circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.03303, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
6 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
A Note on Polynomial Identity Testing for Depth-3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.06692, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
6 | Ning Ding 0001, Yanli Ren, Dawu Gu |
PAC Learning Depth-3 $\textrm{AC}^0$ Circuits of Bounded Top Fanin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: International Conference on Algorithmic Learning Theory, ALT 2017, 15-17 October 2017, Kyoto University, Kyoto, Japan, pp. 667-680, 2017, PMLR. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
6 | Ankit Gupta 0001, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi |
Arithmetic Circuits: A Chasm at Depth 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 45(3), pp. 1064-1079, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
6 | Gaurav Sinha |
Reconstruction of Real Depth-3 Circuits with Top Fan-In 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 31:1-31:53, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-008-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
6 | Gaurav Sinha |
Reconstruction of Real depth-3 Circuits with top fan-in 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1512.01256, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
6 | Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 |
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 22(1), pp. 39-69, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 60(5), pp. 33:1-33:33, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
6 | Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena 0001 |
Hitting-sets for low-distance multilinear depth-3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
6 | Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena 0001 |
Hitting-sets for low-distance multilinear depth-3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.1826, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 41(5), pp. 1285-1298, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
6 | Khalid Mohamed Alajel, Wei Xiang 0001 |
Color plus depth 3-D video transmission with hierarchical 16-QAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
3DTV-Conference ![In: 3DTV-Conference 2012: The True Vision - Capture, Transmission and Display of 3D Video, Zurich, Switzerland, October 15-17, 2012, pp. 1-4, 2012, IEEE, 978-1-4673-4904-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
6 | Zohar Shay Karnin, Amir Shpilka |
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 31(3), pp. 333-364, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
6 | Chandan Saha 0001, Ramprasad Saptharishi, Nitin Saxena 0001 |
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
6 | Craig Gentry, Shai Halevi |
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2011, pp. 279, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
An Almost Optimal Rank Bound for Depth-3 Identities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 40(1), pp. 200-224, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
6 | Craig Gentry, Shai Halevi |
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pp. 107-109, 2011, IEEE Computer Society, 978-1-4577-1843-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pp. 431-440, 2011, ACM, 978-1-4503-0691-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1002.0145, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1011.3234, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, pp. 21-29, 2010, IEEE Computer Society, 978-0-7695-4244-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
6 | Jeffrey Tsang |
The structure of a depth-3 lookup table representation for Prisoner's Dilemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIG ![In: Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, CIG 2010, Copenhagen, Denmark, 18-21 August, 2010, pp. 54-61, 2010, IEEE, 978-1-4244-6295-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
6 | Neeraj Kayal, Shubhangi Saraf |
Blackbox Polynomial Identity Testing for Depth 3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
6 | Amir Shpilka |
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 38(6), pp. 2130-2161, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Neeraj Kayal, Shubhangi Saraf |
Blackbox Polynomial Identity Testing for Depth 3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 198-207, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Sylvester, Derandomization, Arithmetic circuits |
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
An Almost Optimal Rank Bound for Depth-3 Identities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009, pp. 137-148, 2009, IEEE Computer Society, 978-0-7695-3717-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Zohar Shay Karnin, Amir Shpilka |
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009, pp. 274-285, 2009, IEEE Computer Society, 978-0-7695-3717-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
An Almost Optimal Rank Bound for Depth-3 Identities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR08, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
6 | Christian Glaßer, Heinz Schmitz |
Languages of Dot-Depth 3/2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 42(2), pp. 256-286, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Starfree regular languages, Concatenation hierarchies, Dot-depth hierarchy, Decidability |
6 | Nitin Saxena 0001, C. Seshadhri 0001 |
An Almost Optimal Rank Bound for Depth-3 Identities ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0811.3161, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
6 | Alexander A. Sherstov |
Powering requires threshold depth 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 102(2-3), pp. 104-107, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
6 | Zohar Shay Karnin, Amir Shpilka |
Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR07, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
6 | Zeev Dvir, Amir Shpilka |
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 36(5), pp. 1404-1434, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
6 | Tahsin Oner, Dick de Jongh |
The Structure of Rigid Frames of Depth 3 Only. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TbiLLC ![In: Logic, Language, and Computation, 7th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2007, Tbilisi, Georgia, October 1-5, 2007. Revised Selected Papers, pp. 16-22, 2007, Springer, 978-3-642-00664-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
6 | Guy Wolfovitz |
The complexity of depth-3 circuits computing symmetric Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 100(2), pp. 41-46, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
6 | Guy Wolfovitz |
The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR06, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|