Algorithmic properties of polynomial rings
From MaRDI portal
Recommendations
Cited in
(22)- New developments in the theory of Gröbner bases and applications to formal verification
- On the complexity of counting components of algebraic varieties
- Computer algebra and algebraic geometry -- achievements and perspectives
- Gröbner bases in orders of algebraic number fields.
- A topological view on algebraic computation models
- On the theories of triangular sets
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- An algorithmic approach to the existence of ideal objects in commutative algebra
- Multiplicity-preserving triangular set decomposition of two polynomials
- Algorithms for near-rings of non-linear transformations
- An algorithm for polynomial multiplication that does not depend on the ring constants
- Algorithms for computing triangular decomposition of polynomial systems
- scientific article; zbMATH DE number 671745 (Why is no real title available?)
- Polynomials, -ideals, and the principal lattice
- Algorithmic Polynomials
- Algorithmic polynomials
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- Effective generic freeness and applications to local cohomology
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
- Simple characteristic decomposition of polynomial sets
This page was built for publication: Algorithmic properties of polynomial rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273764)
