A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Divide and Conquer Method to Compute Binomial Ideals
[chapter]

2014
*
Lecture Notes in Computer Science
*

A binomial is a polynomial with at most two terms. In this paper, we give a divide-and-conquer strategy to compute binomial ideals. This work is a generalization of the work done by the authors in [12, 13] and is motivated by the fact that any algorithm to compute binomial ideals spends a significant amount of time computing Gröbner basis and that Gröbner basis computation is very sensitive to the number of variables in the ring. The divide and conquer strategy breaks the problem into

doi:10.1007/978-3-642-54423-1_56
fatcat:wframq5albavfnqtowl6m7usny