A two-dimensional improvement for Farr-Gao algorithm

DOI10.1007/s11424-016-4113-9zbMath1386.13070arXiv1001.1196OpenAlexW2462378719MaRDI QIDQ1691951

Tian Dong

Publication date: 25 January 2018

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.1196

zbMATH Keywords

Gröbner basisvanishing idealGröbner éscalierNewton interpolation basistower set

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Geometric characterization of data sets with unique reduced Gröbner bases

Uses Software

• Maple

Cites Work

• Interpolation from spaces spanned by monomials
• A bivariate preprocessing paradigm for the Buchberger-Möller algorithm
• Computing ideals of points
• A computational algebra approach to the reverse engineering of gene regulatory networks
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• FINITE SETS OF AFFINE POINTS WITH UNIQUE ASSOCIATED MONOMIAL ORDER QUOTIENT BASES
• Gröbner Bases, Coding, and Cryptography
• Lagrange interpolation on subgrids of tensor product grids
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Unnamed Item
• Unnamed Item

This page was built for publication: A two-dimensional improvement for Farr-Gao algorithm