| Publication | Date of Publication | Type |
|---|
| Low-depth arithmetic circuit lower bounds: bypassing set-multilinearization | 2024-11-14 | Paper |
| Learning generalized depth three arithmetic circuits in the non-degenerate case | 2024-08-22 | Paper |
Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
| Determinant Equivalence Test over Finite Fields and over Q | 2022-07-21 | Paper |
| Reconstruction of full rank algebraic branching programs | 2020-05-26 | Paper |
Reconstruction of non-degenerate homogeneous depth three circuits
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
Computational Complexity | 2019-12-19 | Paper |
Reconstruction of full rank algebraic branching programs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree
Theory of Computing | 2019-01-31 | Paper |
Erratum: ``PRIMES is in P
Annals of Mathematics. Second Series | 2019-01-18 | Paper |
Multi-\(k\)-ic depth three circuit lower bound
Theory of Computing Systems | 2018-02-01 | Paper |
| Lower bounds for depth three arithmetic circuits with small bottom fanin | 2018-01-24 | Paper |
| Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits | 2018-01-24 | Paper |
| An almost cubic lower bound for depth three arithmetic circuits | 2017-12-19 | Paper |
| Efficient algorithms for some special cases of the polynomial equivalence problem | 2017-09-29 | Paper |
On the size of homogeneous and of depth four formulas with low individual degree
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
An exponential lower bound for homogeneous depth four arithmetic formulas
SIAM Journal on Computing | 2017-03-10 | Paper |
| Multi-\(k\)-ic depth three circuit lower bound | 2017-01-24 | Paper |
A Selection of Lower Bounds for Arithmetic Circuits
Perspectives in Computational Complexity | 2016-09-22 | Paper |
Arithmetic circuits: a chasm at depth 3
SIAM Journal on Computing | 2016-07-04 | Paper |
Lower bounds for depth-three arithmetic circuits with small bottom fanin
Computational Complexity | 2016-06-30 | Paper |
Lower bounds for sums of powers of low degree univariates
Automata, Languages, and Programming | 2015-10-27 | Paper |
On the Sum of Square Roots of Polynomials and Related Problems
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
A super-polynomial lower bound for regular arithmetic formulas
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Blackbox Polynomial Identity Testing for Depth 3 Circuits
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Affine projections of polynomials (extended abstract)
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Partial derivatives in arithmetic complexity and beyond
Foundations and Trends in Theoretical Computer Science | 2014-01-15 | Paper |
Factoring Groups Efficiently
Automata, Languages and Programming | 2009-07-14 | Paper |
Polynomial identity testing for depth 3 circuits
Computational Complexity | 2008-02-22 | Paper |
Complexity of ring morphism problems
Computational Complexity | 2007-11-14 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
PRIMES is in P
Annals of Mathematics. Second Series | 2005-04-18 | Paper |
