Computing Gröbner bases of ideals of few points in high dimensions
From MaRDI portal
Publication:5269710
DOI10.1145/1279721.1279722zbMath1369.13035arXivmath/0606189OpenAlexW3122477791MaRDI QIDQ5269710
Brandilyn Stigler, Winfried Just
Publication date: 27 June 2017
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0606189
Gröbner basesrun-time complexityBuchberger-Möller algorithmessential variablescomputational biology applications
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) General biology and biomathematics (92B05)
Related Items
The Number of Gröbner Bases in Finite Fields (Research) ⋮ A bivariate preprocessing paradigm for the Buchberger-Möller algorithm ⋮ Common eigenvector approach to exact order reduction for Roesser state-space models of multidimensional systems ⋮ Degröbnerization: a political manifesto
Uses Software