Abstract
Farr-Gao algorithm is a state-of-the-art algorithm for reduced Gröbner bases of vanishing ideals of finite points, which has been implemented in Maple as a build-in command. In this paper, we present a two-dimensional improvement for it that employs a preprocessing strategy for computing reduced Gröbner bases associated with tower subsets of given point sets. Experimental results show that the preprocessed Farr-Gao algorithm is more efficient than the classical one.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.