Skip to main content
Conference Proceedings

Stability conditions of monomial bases and comprehensive Gröbner systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7442 LNCS 248-259
DOI: 10.1007/978-3-642-32973-9_21
21Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new stability condition of monomial bases is introduced. This stability condition is stronger than Kapur-Sun-Wang’s one. Moreover, a new algorithm for computing comprehensive Gröbner systems, is also introduced by using the new stability condition. A number of segments generated by the new algorithm is smaller than that of segments of in Kapur-Sun-Wang’s algorithm.

Cite

CITATION STYLE

APA

Nabeshima, K. (2012). Stability conditions of monomial bases and comprehensive Gröbner systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7442 LNCS, pp. 248–259). Springer Verlag. https://doi.org/10.1007/978-3-642-32973-9_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free