Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree
暂无分享,去创建一个
[1] Ilya Volkovich,et al. On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors , 2010, ICALP.
[2] A. M. Ostrowski. On the significance of the theory of convex polyhedra for formal algebra , 1999, SIGS.
[3] J. von zur Gathen. Factoring sparse multivariate polynomials , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[4] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[5] Erich Kaltofen,et al. Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators , 1990, J. Symb. Comput..
[6] Ilya Volkovich,et al. Improved Polynomial Identity Testing for Read-Once Formulas , 2009, APPROX-RANDOM.
[7] Rafael Oliveira,et al. Factors of low individual degree polynomials , 2015, computational complexity.
[8] Ilya Volkovich,et al. Black-Box Identity Testing of Depth-4 Multilinear Circuits , 2011, Combinatorica.
[9] Joachim von zur Gathen. Who was who in polynomial factorization: 1 , 2006, ISSAC '06.
[10] Siddharth Barman,et al. Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem , 2015, STOC.
[11] G. Ziegler. Lectures on Polytopes , 1994 .
[12] Erich Kaltofen,et al. Deterministic distinct-degree factorization of polynomials over finite fields , 2004, J. Symb. Comput..
[13] Erich Kaltofen,et al. Factorization of Polynomials Given by Straight-Line Programs , 1989, Adv. Comput. Res..
[14] Ilya Volkovich,et al. Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials , 2015, APPROX-RANDOM.
[15] A. Schinzel,et al. Polynomials with Special Regard to Reducibility: Index of terms , 2000 .
[16] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[17] Andrzej Schinzel,et al. Polynomials with Special Regard to Reducibility , 2000 .
[18] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[19] ChallengesPaul ZimmermannInria Lorrainezimmermann. Polynomial Factorization , 1996 .
[20] Erich Kaltofen,et al. Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[21] Keith O. Geddes,et al. Algorithms for computer algebra , 1992 .
[22] Erich Kaltofen,et al. Polynomial factorization: a success story , 2003, ISSAC '03.
[23] Zeev Dvir,et al. Factors of Sparse Polynomials are Sparse , 2014, Electron. Colloquium Comput. Complex..
[24] Ronald L. Rivest,et al. A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields , 1984, CRYPTO.
[25] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[26] Shubhangi Saraf,et al. Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[27] E. Berlekamp. Factoring polynomials over large finite fields* , 1971, SYMSAC '71.
[28] Daniel A. Spielman,et al. Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.
[29] E. Berlekamp. Factoring polynomials over large finite fields , 1970 .
[30] Amir Shpilka,et al. Complexity Theory Column 88 , 2015, SIGACT News.
[31] Ilya Volkovich,et al. On Some Computations on Sparse Polynomials , 2017, APPROX-RANDOM.
[32] Victor Shoup. A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic , 1991, ISSAC '91.
[33] N. Kayal. DERANDOMIZING SOME NUMBER-THEORETIC AND ALGEBRAIC ALGORITHMS. , 2006 .
[34] Erich Kaltofen. Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials , 1987, STOC '87.