Fast Probabilistic Algorithms for Verification of Polynomial Identities
暂无分享,去创建一个
[1] L. Bieberbach. Vorlesungen über Algebra: Unter Benutzung der Dritten Auflage des Gleichnamigen Werkes von ᾠDr. Gustav Bauer , 1904 .
[2] Grete Hermann,et al. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .
[3] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[4] M. Nakamura,et al. Expectations in an operator algebra , 1954 .
[5] A. Seidenberg. A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .
[6] G. Szegö,et al. On algebraic equations with integral coefficients whose roots belong to a given point set , 1955 .
[7] L. E. Heindel. Integer Arithmetic Algorithms for Polynomial Real Zero Determination , 1971, JACM.
[8] Determining the Equivalence of Algebraic Expressions by Hash Coding , 1971, JACM.
[9] George E. Collins,et al. The Calculation of Multivariate Polynomial Resultants , 1971, JACM.
[10] Robert T. Moenck,et al. Fast computation of GCDs , 1973, STOC.
[11] G. E. Collins. Computer Algebra of Polynomials and Rational Functions , 1973 .
[12] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[13] Philip J. Davis,et al. Proof, Completeness, Transcendentals, and Sampling , 1977, JACM.
[14] J. Schwartz,et al. A note on monte carlo primality tests and algorithmic information theory , 1978 .