Learning a performance metric of Buchberger's algorithm

DOI10.2140/involve.2023.16.227arXiv2106.03676OpenAlexW4379517175MaRDI QIDQ6117059

Jelena Mojsilović, Sonja Petrović, Dylan Peifer

Publication date: 19 July 2023

Published in: Involve (Search for Journal in Brave)

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

zbMATH Keywords

Groebner basismachine learning

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Diagnostics, and linear inference and regression (62J20)

Cites Work

• Unnamed Item
• Unnamed Item
• Random sampling in computational algebra: Helly numbers and violator spaces
• Improving multivariate Horner schemes with Monte Carlo tree search
• On Smale's 17th problem: a probabilistic positive solution
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Random monomial ideals
• Machine learning for mathematical software
• Learning algebraic varieties from samples
• Algebraic algorithms for sampling from conditional distributions
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Short rational functions for toric algebra and applications
• Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
• Sparse Gröbner bases
• The Structure of Polynomial Ideals and Gröbner Bases
• Smoothed analysis of algorithms
• A Fast Monte-Carlo Test for Primality
• A Geometric Buchberger Algorithm for Integer Programming
• Average behavior of minimal free resolutions of monomial ideals
• Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition

This page was built for publication: Learning a performance metric of Buchberger's algorithm