F. Winkler. On the Complexity of the Gr#bner Bases Algorithm over K[x,y,z]. In J. Fitch, editor, Proceedings of EUROSAM'84, Lecture Notes in Computer Science 174, pages 184194, Cambridge (England), July 1984. Springer-Verlag. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Solver Collaboration for Constraint Logic Programming - Monfroy (1996) (13 citations) (Correct)
....in the number of variables. Fortunately, this method can be modied and some 26 Chapter 1. Non linear solvers criteria and strategies introduced to improve the performance of the algorithm. The degree of the obtained Gr#bner base is also of great interest. Some studies on this topic have been made [Win84, Laz83]. Some results show that the degree and the variables appearing in the head terms of the polynomials of the Gr#bner base are dependent on the ordering. The ordering and the precedence on variables are also an important factors of the running time [BGK86] Using lexicographic ordering generally ....
F. Winkler. On the Complexity of the Gr#bner Bases Algorithm over K[x,y,z]. In J. Fitch, editor, Proceedings of EUROSAM'84, Lecture Notes in Computer Science 174, pages 184194, Cambridge (England), July 1984. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC