Polynomial Factorization 1987-1991
暂无分享,去创建一个
[1] Emmy Noether. Ein algebraisches Kriterium für absolute Irreduzibilität , 1922 .
[2] Paul S. Wang. Factoring multivariate polynomials over algebraic number fields , 1976 .
[3] Trevor J. Smedley. Fast methods for computation with algebraic numbers , 1990 .
[4] Arnold Schönhage,et al. The fundamental theorem of algebra in terms of computational complexity - preliminary report , 1982 .
[5] I. E. Shparlinskii. On some problems in the theory of finite fields , 1991 .
[6] Susan Landau,et al. Polynomial Decomposition Algorithms , 1989, J. Symb. Comput..
[7] Erich Kaltofen,et al. Factorization of Polynomials Given by Straight-Line Programs , 1989, Adv. Comput. Res..
[8] A. C. Norman,et al. Implementing a polynomial factorization and GCD package , 1981, SYMSAC '81.
[9] D. Cantor,et al. A new algorithm for factoring polynomials over finite fields , 1981 .
[10] László Lovász,et al. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers , 1984, STOC '84.
[11] F. R. Gantmakher. The Theory of Matrices , 1984 .
[12] Arnold Schönhage. Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm , 1984, ICALP.
[13] Roberto Dvornicich,et al. Newton Symmetric Functions and the Arithmetic of Algebraically Closed Fields , 1987, AAECC.
[14] Erich Kaltofen,et al. Modular rational sparse multivariate polynomial interpolation , 1990, ISSAC '90.
[15] Volker Strassen,et al. Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[16] D. V. Chudnovsky,et al. Number theory : New York seminar 1989-1990 , 1991 .
[17] Robert T. Moenck,et al. On the efficiency of algorithms for polynomial factoring , 1977 .
[18] Peter J. Weinberger,et al. Factoring Polynomials Over Algebraic Number Fields , 1976, TOMS.
[19] J. Gathen. Hensel and Newton methods in valuation rings , 1984 .
[20] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .
[21] R. Loos. Computing in Algebraic Extensions , 1983 .
[22] 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..
[23] Keith O. Geddes,et al. Heuristic Methods for Operations With Algebraic Numbers. (Extended Abstract) , 1988, ISSAC.
[24] E. Berlekamp. Factoring polynomials over large finite fields* , 1971, SYMSAC '71.
[25] Chandrajit L. Bajaj,et al. Automatic parameterization of rational curves and surfaces III: Algebraic plane curves , 1988, Comput. Aided Geom. Des..
[26] Wolfgang M. Schmidt,et al. Equations over Finite Fields: An Elementary Approach , 1976 .
[27] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[28] Susan Landau. Simplification of Nested Radicals , 1992, SIAM J. Comput..
[29] Lajos Rónyai,et al. Galois groups and factoring polynomials over finite fields , 1989, 30th Annual Symposium on Foundations of Computer Science.
[30] Peter Lancaster,et al. The theory of matrices , 1969 .
[31] Erich Kaltofen,et al. Greatest common divisors of polynomials given by straight-line programs , 1988, JACM.
[32] Paul S. Wang,et al. Polynomial Factorization Sharp Bounds, Efficient Algorithms , 1993, J. Symb. Comput..
[33] Joos Heintz,et al. Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables , 1981, ICALP.
[34] Victor Shoup. On the Deterministic Complexity of Factoring Polynomials over Finite Fields , 1990, Inf. Process. Lett..
[35] James H. Davenport,et al. The Bath algebraic number package , 1986, SYMSAC '86.
[36] Joachim von zur Gathen,et al. Irreducibility of Multivariate Polynomials , 1985, J. Comput. Syst. Sci..
[37] Michael Lucks. A fast implementation of polynomial factorization , 1986, SYMSAC '86.
[38] Marek Karpinski,et al. Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..
[39] David Y. Y. Yun,et al. The Hensel Lemma in Algebraic Manipulation , 1973, Outstanding Dissertations in the Computer Sciences.
[40] Michael Ben-Or,et al. A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.
[41] Štefan Schwarz. ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD , 1956 .
[42] G. E. Collins. Infallible Calculation of Polynomial Zeros to Specified Precision , 1977 .
[43] Immo O. Kerner,et al. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen , 1966 .
[44] D. Trigiante,et al. A globally convergent method for simultaneously finding polynomial roots , 1985 .
[45] Jan van Leeuwen,et al. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity , 1994 .
[46] A. T. Ly. A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(p m ) of GF(p), p a Small Prime , 1989 .
[47] Joachim von zur Gathen,et al. Factoring Polynomials and Primitive Elements for Special Primes , 1987, Theor. Comput. Sci..
[48] Stephen A. Cook,et al. A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..
[49] James H. Davenport,et al. Scratchpad's view of algebra II: A categorical view of factorization , 1991, ISSAC '91.
[50] Herbert S. Wilf. A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane , 1978, JACM.
[51] Rudolf Lide,et al. Finite fields , 1983 .
[52] Erich Kaltofen,et al. Effective Hilbert Irreducibility , 1984, Inf. Control..
[53] Kazuhiro Yokoyama,et al. On factoring multi-variate polynomials over algebraically closed fields (abstract) , 1990, ISSAC '90.
[54] David A. Plaisted. Sparse Complex Polynomials and Polynomial Reducibility , 1977, J. Comput. Syst. Sci..
[55] C. Andrew Neff,et al. Specified precision polynomial root isolation is in NC , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[56] Hale F. Trotter. Statistics on factoring polynomials mod p and p-adically , 1982, SIGS.
[57] Michael B. Monagan,et al. A Heuristic Irreducibility Test for Univariate Polynomials , 1992, J. Symb. Comput..
[58] W. Schmidt. Equations over Finite Fields: An Elementary Approach , 1976 .
[59] V. Sprindžuk,et al. Arithmetic specializations in polynomials. , 1983 .
[60] Richard J. Lipton,et al. Evaluation of polynomials with super-preconditioning , 1976, STOC '76.
[61] Lajos Rónyai,et al. Factoring polynomials over finite fields , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[62] L. Mirsky,et al. The Theory of Matrices , 1961, The Mathematical Gazette.
[63] Henri Lombardi. Algèbre élémentaire en temps polynominal , 1989 .
[64] Joseph J. Rotman. Solvability by Radicals , 1990 .
[65] H. Zassenhaus. On Hensel factorization, I , 1969 .
[66] Joachim von zur Gathen,et al. Functional Decomposition of Polynomials: The Wild Case , 1990, J. Symb. Comput..
[67] Michael Ben-Or,et al. Simple algorithms for approximating all roots of a polynomial with real roots , 1990, J. Complex..
[68] L. Kronecker. Grundzüge einer arithmetischen Theorie der algebraische Grössen. , 2022 .
[69] Erich Kaltofen,et al. Improved Sparse Multivariate Polynomial Interpolation Algorithms , 1988, ISSAC.
[70] J. Calmet. Computer Algebra , 1982 .
[71] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..
[72] M. C. R. Butler. ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD , 1954 .
[73] Paul S. Wang. An improved multivariate polynomial factoring algorithm , 1978 .
[74] J. Shepherdson,et al. Effective procedures in field theory , 1956, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.
[75] A. Odlyzko,et al. Irreducibility testing and factorization of polynomials , 1983 .
[76] Erich Kaltofen,et al. Dagwood: a system for manipulating polynomials given by straight-line programs , 1988, TOMS.
[77] Billy G. Claybrook. A New Approach to the Symbolic Factorization of Multivariate Polynomials , 1976, Artif. Intell..
[78] James R. Pinkert,et al. An Exact Method for Finding the Roots of a Complex Polynomial , 1976, TOMS.
[79] W. Rogosinski,et al. The Geometry of the Zeros of a Polynomial in a Complex Variable , 1950, The Mathematical Gazette.
[80] E. Kaltofen,et al. Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields by Integer Lattice Reduction , 1991 .
[81] John Abbott,et al. Recovery of algebraic numbers from their p-adic approximations , 1989, ISSAC '89.
[82] Alfred Menezes,et al. Some Computational Aspects of Root Finding in GF(qm) , 1988, ISSAC.
[83] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[84] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.
[85] B. L. Waerden. Eine Bemerkung über die Unzerlegbarkeit von Polynomen , 2022 .
[86] Guy Viry. Factorization of Multivariate Polynomials with Coefficients in F_p , 1993, J. Symb. Comput..
[87] Erich Kaltofen,et al. Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..
[88] Erich Kaltofen,et al. A generalized class of polynomials that are hard to factor , 1981, SYMSAC '81.
[89] Erich Kaltofen,et al. Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization , 1985, SIAM J. Comput..
[90] Stuart J. Berkowitz,et al. On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..
[91] Victor Shoup,et al. Smoothness and Factoring Polynomials Over Finite Fields , 1991, Inf. Process. Lett..
[92] Paul Camion. Un Algorithme De Construction Des Idempotents Primitifs D'Ideaux D'Algebres Sur Fq , 1982 .
[93] Dominique Duval,et al. Absolute Factorization of Polynomials: A Geometric Approach , 1991, SIAM J. Comput..
[94] Ming-Deh A. Huang. Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields , 1991, J. Algorithms.
[95] Eric Bach,et al. Factoring Polynomials Using Fewer Random Bits , 1990, J. Symb. Comput..
[96] Winfried Neun,et al. On Gröbner Bases Computation on a Supercomputer Using REDUCE. , 1988 .
[97] Ming-Deh A. Huang. Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields , 1991, J. Algorithms.
[98] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[99] Joachim von zur Gathen,et al. Functional Decomposition of Polynomials: The Tame Case , 1990, J. Symb. Comput..
[100] Richard Zippel,et al. Rational function decomposition , 1991, ISSAC '91.
[101] John F. Canny,et al. Factoring rational polynomials over the complexes , 1989, ISSAC '89.
[102] 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.
[103] Erich Kaltofen. Deterministic Irreducibility Testing of Polynomials over Large Finite Fields , 1987, J. Symb. Comput..
[104] Gary L. Miller,et al. Solvability by Radicals is in Polynomial Time , 1985, J. Comput. Syst. Sci..
[105] Victor Shoup. A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic , 1991, ISSAC '91.
[106] Gary L. Miller,et al. On taking roots in finite fields , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[107] Paul S. Wang,et al. Parallel univariate polynomial factorization on shared-memory multiprocessors , 1990, ISSAC '90.
[108] Richard Zippel,et al. Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..
[109] Erich Kaltofen,et al. DSC: a system for distributed symbolic computation , 1991, ISSAC '91.
[110] Richard Zippel. Newton's iteration and the sparse Hensel algorithm (Extended Abstract) , 1981, SYMSAC '81.
[111] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[112] Barry M. Trager,et al. Algebraic factoring and rational function integration , 1976, SYMSAC '76.
[113] David R. Musser,et al. Multivariate Polynomial Factorization , 1975, JACM.
[114] L. Kronecker. Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Abdruck einer Festschrift zu Herrn E. E. Kummers Doctor-Jubiläum, 10. September 1881.). , 2022 .
[115] Paul S. Wang,et al. Practical factorization of univariate polynomials over finite fields , 1991, ISSAC '91.