A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra
暂无分享,去创建一个
[1] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..
[2] B. Buchberger. An Algorithmic Method in Polynomial Ideal Theory , 1985 .
[3] N. Bose. Multidimensional Systems Theory , 1985 .
[4] Mark E. Stickel,et al. A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.
[5] D. McIlroy. Algebraic Simplification , 1966, CACM.
[6] Nachum Dershowitz,et al. Existence, Uniqueness, and Construction of Rewrite Systems , 1988, SIAM J. Comput..
[7] H. Brown,et al. Computational Problems in Abstract Algebra , 1971 .
[8] Gérard P. Huet,et al. An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations , 1978, Inf. Process. Lett..
[9] Bruno Buchberger,et al. A theoretical basis for the reduction of polynomials to canonical forms , 1976, SIGS.
[10] David Shannon,et al. Using Gröbner Bases to Determine Algebra Membership Split Surjective Algebra Homomorphisms Determine Birational Equivalence , 1988, J. Symb. Comput..
[11] D. Buchsbaum,et al. Commutative Algebra, Vol. II. , 1959 .
[12] Bruno Buchberger,et al. Computer algebra symbolic and algebraic computation , 1982, SIGS.
[13] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .