AAAAAA

   
Results: 1-8 |
Results: 8

Authors: KALKBRENER M
Citation: M. Kalkbrener, ALGORITHMIC PROPERTIES OF POLYNOMIAL-RINGS, Journal of symbolic computation, 26(5), 1998, pp. 525-581

Authors: COLLART S KALKBRENER M MALL D
Citation: S. Collart et al., CONVERTING BASES WITH THE GROBNER WALK, Journal of symbolic computation, 24(3-4), 1997, pp. 465-469

Authors: KALKBRENER M
Citation: M. Kalkbrener, ON THE STABILITY OF GROBNER BASES UNDER SPECIALIZATIONS, Journal of symbolic computation, 24(1), 1997, pp. 51-58

Authors: KALKBRENER M
Citation: M. Kalkbrener, A GENERALIZED EUCLIDEAN ALGORITHM FOR GEOMETRY THEOREM-PROVING, Annals of mathematics and artificial intelligence, 13(1-2), 1995, pp. 73-95

Authors: KALKBRENER M STURMFELS B
Citation: M. Kalkbrener et B. Sturmfels, INITIAL COMPLEXES OF PRIME IDEALS, Advances in mathematics, 116(2), 1995, pp. 365-376

Authors: KALKBRENER M
Citation: M. Kalkbrener, PRIME DECOMPOSITIONS OF RADICALS IN POLYNOMIAL-RINGS, Journal of symbolic computation, 18(4), 1994, pp. 365-372

Authors: KALKBRENER M SWEEDLER M TAYLOR L
Citation: M. Kalkbrener et al., LOW DEGREE SOLUTIONS TO LINEAR-EQUATIONS WITH K[X] COEFFICIENTS, Journal of symbolic computation, 16(1), 1993, pp. 75-81

Authors: KALKBRENER M
Citation: M. Kalkbrener, A GENERALIZED EUCLIDEAN ALGORITHM FOR COMPUTING TRIANGULAR REPRESENTATIONS OF ALGEBRAIC-VARIETIES, Journal of symbolic computation, 15(2), 1993, pp. 143-167
Risultati: 1-8 |