Matrix-F5 algorithms over finite-precision complete discrete valuation fields
DOI10.1016/j.jsc.2016.05.001zbMath1362.13030arXiv1403.5464OpenAlexW2407324517MaRDI QIDQ5891054
Publication date: 29 November 2016
Published in: Journal of Symbolic Computation, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.5464
Gröbner basesregular sequenceF5 algorithm\(p\)-adic algorithm\(p\)-adic precisionapproximate Gröbner basislifing of Gröbner basesmatrix-F5 algorithmweakly-\(w\)-idealMoreno-Socias conjecture
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials, factorization in commutative rings (13P05) Valuation rings (13F30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Artificial discontinuities of single-parametric Gröbner bases
- Introduction to the solution of polynomial systems
- Deformations and the rigidity method
- Generic sequences of polynomials
- A p-adic approach to the computation of Gröbner bases
- On lucky ideals for Gröbner basis computations
- On lucky primes
- Remarks on automatic algorithm stabilization
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Modular algorithms for computing Gröbner bases.
- Matrix-F5 algorithms and tropical Gröbner bases computation
- Ring-theoretic properties of certain Hecke algebras
- Generic initial ideals of points and curves
- Cylindrical algebraic decomposition using validated numerics
- p-Adic Stability In Linear Algebra
- Linear algebra over and related rings
- Tracking -adic precision
- On the complexity of computing gröbner bases for quasi-homogeneous systems
- Sub-cubic change of ordering for Gröbner basis
- Term Cancellations in Computing Floating-Point Gröbner Bases
- A Study on Gröbner Basis with Inexact Input
- Gröbner bases over fields with valuations
- Computing floating-point Gröbner bases accurately
- Deformations of Galois Representations
- The Jordan Curve Theorem, Formally and Informally
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Definability and decision problems in arithmetic
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields
- Algorithmic Number Theory
