Factorization of Polynomials Given by Arithmetic Branching Programs
暂无分享,去创建一个
[1] Meena Mahajan,et al. Algebraic Complexity Classes , 2013, ArXiv.
[2] Erich Kaltofen. Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials , 1987, STOC '87.
[3] Shubhangi Saraf,et al. Equivalence of Polynomial Identity Testing and Polynomial Factorization , 2015, computational complexity.
[4] Keith O. Geddes,et al. Algorithms for Computer Algebra , 1992 .
[5] Erich Kaltofen,et al. Uniform closure properties of P-computable functions , 1986, STOC '86.
[6] Erich Kaltofen,et al. Effective Noether irreducibility forms and applications , 1991, STOC '91.
[7] Stuart J. Berkowitz,et al. On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..
[8] Kurt Hensel. Eine neue Theorie der algebraischen Zahlen , 1918 .
[9] Nitin Saxena,et al. Discovering the roots: uniform closure results for algebraic classes under factoring , 2017, Electron. Colloquium Comput. Complex..
[10] L. Csanky,et al. Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..
[11] Rafael Oliveira,et al. Factors of low individual degree polynomials , 2015, computational complexity.