Pages that link to "Item:Q1273764"
From MaRDI portal
The following pages link to Algorithmic properties of polynomial rings (Q1273764):
Displaying 18 items.
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)? (Q651871) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- New developments in the theory of Gröbner bases and applications to formal verification (Q1017680) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Computer algebra and algebraic geometry -- achievements and perspectives (Q1587227) (← links)
- Gröbner bases in orders of algebraic number fields. (Q1599544) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- On the theories of triangular sets (Q1808664) (← links)
- Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665) (← links)
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\) (Q2258082) (← links)
- Multiplicity-preserving triangular set decomposition of two polynomials (Q2341596) (← links)
- Algorithms for near-rings of non-linear transformations (Q3454740) (← links)
- An algorithm for polynomial multiplication that does not depend on the ring constants (Q3792774) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- Algorithmic polynomials (Q5230299) (← links)
- Effective generic freeness and applications to local cohomology (Q6641559) (← links)
