On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials | 0 | 0.34 | 2022 |
Reconstruction of full rank Algebraic Branching Programs. | 0 | 0.34 | 2017 |
On the Sensitivity Conjecture for Read-k Formulas. | 3 | 0.40 | 2016 |
On the size of homogeneous and of depth four formulas with low individual degree. | 2 | 0.38 | 2016 |
VNP=VP in the multilinear world | 0 | 0.34 | 2016 |
On the Sensitivity Conjecture for Disjunctive Normal Forms. | 2 | 0.37 | 2016 |
A $$\tau $$ τ -Conjecture for Newton Polygons. | 0 | 0.34 | 2015 |
Building Efficient and Compact Data Structures for Simplicial Complexes. | 1 | 0.37 | 2015 |
Log-concavity and lower bounds for arithmetic circuits. | 0 | 0.34 | 2015 |
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. | 2 | 0.42 | 2013 |
On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem | 0 | 0.34 | 2013 |
A tau-conjecture for Newton polygons. | 0 | 0.34 | 2013 |
Detecting wheels. | 0 | 0.34 | 2013 |
A Wronskian approach to the real τ-conjecture. | 4 | 0.55 | 2012 |