The computation of Gröbner bases on a shared memory multiprocessor
暂无分享,去创建一个
[1] Carl Glen Ponder. Evaluation of performance enhancements in algebraic manipulation systems , 1988 .
[2] H. Michael Möller,et al. The computation of the Hilbert function , 1983, EUROCAL.
[3] S. Watt. Bounded parallelism in computer algebra , 1986 .
[4] F. S. Macaulay. Some Properties of Enumeration in the Theory of Modular Systems , 1927 .
[5] W. Fulton,et al. Algebraic Curves: An Introduction to Algebraic Geometry , 1969 .
[6] Marc Giusti,et al. Combinatorial Dimension Theory of Algebraic Varieties , 1988, J. Symb. Comput..
[7] Bruno Buchberger,et al. History and Basic Features of the Critical-Pair/Completion Procedure , 1987, J. Symb. Comput..
[8] R. Pavelle. Applications of computer algebra , 1985 .
[9] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[10] N. Jacobson,et al. Basic Algebra I , 1976 .
[11] Bruno Buchberger,et al. Some properties of Gröbner-bases for polynomial ideals , 1976, SIGS.
[12] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .
[13] Heinz Kredel,et al. Some Examples for Solving Systems of Algebraic Equations by Calculating Groebner Bases , 1986, J. Symb. Comput..
[14] André Galligo,et al. Greater Easy Common Divisor and Standard Basis Completion Algorithms , 1988, ISSAC.
[15] Susan S. Owicki,et al. Axiomatic Proof Techniques for Parallel Programs , 1975, Outstanding Dissertations in the Computer Sciences.
[16] Heinz Kredel,et al. Computing Dimension and Independent Sets for Polynomial Ideals , 1988, J. Symb. Comput..
[17] David Shannon,et al. Using Gröbner Bases to Determine Algebra Membership Split Surjective Algebra Homomorphisms Determine Birational Equivalence , 1988, J. Symb. Comput..
[18] Rüdiger Gebauer,et al. On an Installation of Buchberger's Algorithm , 1988, J. Symb. Comput..
[19] Patrizia M. Gianni,et al. Gröbner Bases and Primary Decomposition of Polynomial Ideals , 1988, J. Symb. Comput..
[20] Bruno Buchberger,et al. A theoretical basis for the reduction of polynomials to canonical forms , 1976, SIGS.
[21] Carlo Traverso,et al. Experimenting the Gröbner basis algorithm with the A1PI system , 1989, ISSAC '89.
[22] William J. Bolosky,et al. Mach: A New Kernel Foundation for UNIX Development , 1986, USENIX Summer.
[23] H. Hironaka. Resolution of Singularities of an Algebraic Variety Over a Field of Characteristic Zero: II , 1964 .
[24] Bruno Buchberger,et al. A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.
[25] Franz Winkler. The Church-Rosser property in computer algebra and special theorem proving: an investigation of critical-pair/completion algorithms (Ph.D. thesis) , 1984, SIGS.
[26] A. Galligo,et al. Practical Determination of the Dimension of an Algebraic Variety , 1989, Computers and Mathematics.
[27] Per Brinch Hansen,et al. Operating System Principles , 1973 .