Improved Polynomial Identity Testing for Read-Once Formulas
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
Tensor-rank and lower bounds for arithmetic formulas
Proceedings of the forty-second ACM symposium on Theory of computing
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
Proceedings of the forty-third annual ACM symposium on Theory of computing
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algebraic independence and blackbox identity testing
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
An Almost Optimal Rank Bound for Depth-3 Identities
SIAM Journal on Computing
On identity testing of tensors, low-rank recovery and compressed sensing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Reconstruction of depth-4 multilinear circuits with top fan-in 2
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Algebraic independence and blackbox identity testing
Information and Computation
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Upper bounds on real roots and lower bounds for the permanent
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Quasi-polynomial hitting-set for set-depth-Δ formulas
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Arithmetic circuit lower bounds via maxrank
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Tensor-Rank and Lower Bounds for Arithmetic Formulas
Journal of the ACM (JACM)
Hi-index | 0.00 |
N/A