| Derandomization And Absolute Reconstruction For Sums Of Powers Of Linear Forms | 0 | 0.34 | 2021 |
| Intersection multiplicity of a sparse curve and a low-degree curve. | 0 | 0.34 | 2019 |
| Orthogonal Tensor Decomposition And Orbit Closures From A Linear Algebraic Perspective(?) | 0 | 0.34 | 2019 |
| On the linear independence of shifted powers. | 1 | 0.37 | 2018 |
| Polynomial Equivalence Problems For Sums Of Affine Powers | 0 | 0.34 | 2018 |
| Orbits of monomials and factorization into products of linear forms. | 0 | 0.34 | 2018 |
| Reconstruction Algorithms for Sums of Affine Powers. | 2 | 0.47 | 2017 |
| On the linear independence of shifted powers. | 0 | 0.34 | 2017 |
| On the complexity of partial derivatives. | 1 | 0.36 | 2017 |
| Root separation for trinomials | 0 | 0.34 | 2017 |
| Lower Bounds by Birkhoff Interpolation | 1 | 0.38 | 2015 |
| Lower Bounds for Sums of Powers of Low Degree Univariates. | 5 | 0.53 | 2015 |
| A $$\tau $$ τ -Conjecture for Newton Polygons. | 0 | 0.34 | 2015 |
| Log-concavity and lower bounds for arithmetic circuits. | 0 | 0.34 | 2015 |
| Factoring bivariate lacunary polynomials without heights | 6 | 0.44 | 2013 |
| Computing the multilinear factors of lacunary polynomials without heights | 3 | 0.37 | 2013 |
| On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem | 0 | 0.34 | 2013 |
| Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent. | 1 | 0.35 | 2013 |
| A tau-conjecture for Newton polygons. | 0 | 0.34 | 2013 |
| Computational Counting (Dagstuhl Seminar 13031). | 0 | 0.34 | 2013 |
| A Wronskian approach to the real τ-conjecture. | 4 | 0.55 | 2012 |
| On the complexity of the multivariate resultant | 3 | 0.38 | 2012 |
| Hidden Cliques and the Certification of the Restricted Isometry Property. | 11 | 0.72 | 2012 |
| Upper bounds on real roots and lower bounds for the permanent | 0 | 0.34 | 2012 |
| Symmetric Determinantal Representation of Weakly-Skew Circuits | 1 | 0.35 | 2011 |
| On the expressive power of CNF formulas of bounded tree- and clique-width | 3 | 0.39 | 2011 |
| On the Certification of the Restricted Isometry Property | 7 | 0.83 | 2011 |
| The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent | 6 | 0.96 | 2011 |
| Interpolation in Valiant’s Theory | 9 | 0.58 | 2011 |
| The multivariate resultant is NP-hard in any characteristic | 4 | 0.50 | 2010 |
| Shallow Circuits with High-Powered Inputs | 19 | 1.48 | 2010 |
| Arithmetic circuits: The chasm at depth four gets wider | 53 | 1.95 | 2010 |
| VPSPACE and a transfer theorem over the complex field | 7 | 0.58 | 2009 |
| A Dichotomy Theorem for Polynomial Evaluation | 7 | 0.65 | 2009 |
| A hitting set construction, with application to arithmetic circuit lower bounds | 1 | 0.42 | 2009 |
| A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent | 6 | 0.41 | 2009 |
| The multivariate resultant lies between NP and AM | 0 | 0.34 | 2009 |
| Expressing a fraction of two determinants as a determinant | 16 | 0.92 | 2008 |
| Adversary Lower Bounds for Nonadaptive Quantum Algorithms | 2 | 0.38 | 2008 |
| On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width | 5 | 0.50 | 2008 |
| Finding a vector orthogonal to roughly half a collection of vectors | 4 | 0.45 | 2008 |
| Decision versus evaluation in algebraic complexity | 0 | 0.34 | 2007 |
| The complexity of two problems on arithmetic circuits | 8 | 0.55 | 2007 |
| The quantum query complexity of the abelian hidden subgroup problem | 2 | 0.37 | 2007 |
| On the expressive power of planar perfect matching and permanents of bounded treewidth matrices | 11 | 0.60 | 2007 |
| Valiant's model: from exponential sums to exponential products | 4 | 0.45 | 2006 |
| Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields | 18 | 0.77 | 2006 |
| VPSPACE and a transfer theorem over the reals | 11 | 0.72 | 2006 |
| A quantum lower bound for the query complexity of simon's problem | 8 | 0.66 | 2005 |
| Quantum automata and algebraic groups | 10 | 1.02 | 2005 |
