Random arithmetic formulas can be reconstructed efficiently
- 24 May 2014
- journal article
- Published by Springer Nature in computational complexity
- Vol. 23 (2) , 207-303
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Arithmetic Circuits: A Survey of Recent Results and Open QuestionsFoundations and Trends® in Theoretical Computer Science, 2010
- Solving systems of algebraic equationsACM SIGSAM Bulletin, 2001
- Learning functions represented as multiplicity automataJournal of the ACM, 2000
- The question of finitely many steps in polynomial ideal theoryACM SIGSAM Bulletin, 1998
- Apolarity and Canonical Forms for Homogeneous PolynomialsEuropean Journal of Combinatorics, 1993
- Tensor rank is NP-completeJournal of Algorithms, 1990
- Interpolating polynomials from their valuesJournal of Symbolic Computation, 1990
- Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominatorsJournal of Symbolic Computation, 1990
- Sharp effective NullstellensatzJournal of the American Mathematical Society, 1988
- Die Frage der endlich vielen Schritte in der Theorie der PolynomidealeMathematische Annalen, 1926