Efficient Reconstruction of Random Multilinear Formulas
From MaRDI portal
Publication:5494999
DOI10.1109/FOCS.2011.70zbMath1292.68156MaRDI QIDQ5494999
No author found.
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Computational learning theory (68Q32) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
This page was built for publication: Efficient Reconstruction of Random Multilinear Formulas
