scientific article; zbMATH DE number 3857248
From MaRDI portal
Publication:3325832
Analysis of algorithms and problem complexity (68Q25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Ideals and multiplicative ideal theory in commutative rings (13A15) Relevant commutative algebra (14A05) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
Recommendations
Cited in
(21)- Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
- p-adic algorithm for bivariate Gröbner bases
- Notes on Gröbner bases
- GROEBNER BASES FOR CONSTRUCTIBLE SETS
- Complexity of Gröbner basis detection and border basis detection
- Algebraic decomposition of regular curves
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
- New constructive methods in classical ideal theory
- Distance to the loss of structural properties for linear systems under parametric uncertainties
- On the D-bases of polynomial ideals over principal ideal domains
- On the Jacobian conjecture: A new approach via Gröbner bases
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
- On the complexity of computing Gröbner bases in characteristic 2
- scientific article; zbMATH DE number 4214184 (Why is no real title available?)
- The number of Gröbner bases in finite fields (research)
- Computer algebra: Past and future
- A Note on Dynamic Gröbner Bases Computation
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- History and basic features of the critical-pair/completion procedure
- On the robust hardness of Gröbner basis computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325832)
