The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals

DOI10.1007/978-3-540-93806-4_3zbMath1177.13064OpenAlexW87785082MaRDI QIDQ3652810

Ferdinando Mora

Publication date: 16 December 2009

Published in: Gröbner Bases, Coding, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93806-4_3

Mathematics Subject Classification ID

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

Related Items (3)

Computing Gröbner bases associated with lattices ⋮ Improved decoding of affine-variety codes ⋮ On evaluating multivariate polynomials over finite fields

This page was built for publication: The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals