Pages that link to "Item:Q2879324"
From MaRDI portal
The following pages link to Deterministically Computing Reduction Numbers of Polynomial Ideals (Q2879324):
Displaying 7 items.
- Computing dimension and independent sets for polynomial ideals (Q1116332) (← links)
- Deterministic genericity for polynomial ideals (Q1680155) (← links)
- Computational algorithm for reduction type of CM abelian varieties (Q2333360) (← links)
- Strong non-Noetherity of polynomial reduction (Q2452929) (← links)
- (Q3447182) (← links)
- Computational experiences on the distances of polynomials to irreducible polynomials (Q5691019) (← links)
- A numerical characterization of reduction ideals (Q5949449) (← links)