On Solving Sparse Polynomial Factorization Related Problems
- 1 June 2025
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 34 (1) , 1-65
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Read-once polynomial identity testingcomputational complexity, 2015
- Ideals, Varieties, and Algorithms2015
- A Case of Depth-3 Identity Testing, Sparse Factorization and Dualitycomputational complexity, 2012
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors2010
- Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Boundscomputational complexity, 2004
- Pseudorandom Generators without the XOR LemmaJournal of Computer and System Sciences, 2001
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Algorithms for Computer Algebra1992
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Probabilistic algorithms for sparse polynomials1979