Implementation of prime decomposition of polynomial ideals over small finite fields
DOI10.1016/J.JSC.2003.08.004zbMATH Open1137.13318OpenAlexW1968970774MaRDI QIDQ2643560FDOQ2643560
Authors: Masayuki Noro, Kazuhiro Yokoyama 
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2003.08.004
Recommendations
- scientific article; zbMATH DE number 1860723
- Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
- An algorithm for primary decomposition in polynomial rings over the integers
- scientific article; zbMATH DE number 1273637
- New algorithms for computing primary decomposition of polynomial ideals
- scientific article; zbMATH DE number 1046429
- scientific article; zbMATH DE number 2124962
- Publication:4509882
- The Decomposition of a Rational Prime Ideal in Cyclotomic Fields
- scientific article; zbMATH DE number 177888
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Direct methods for primary decomposition
- Gröbner bases and primary decomposition of polynomial ideals
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Generic polynomials with few parameters
- Lifting standard bases in filtered structures
- Constructions in Algebra
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- Localization and primary decomposition of polynomial ideals
- Solutions of systems of algebraic equations and linear maps on residue class rings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Derivations and radicals of polynomial ideals over fields of arbitrary characteristic
- An algorithm for computing the integral closure
- Title not available (Why is that?)
- Square-free algorithms in positive characteristic
- Computing the radical of an ideal in positive characteristic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Prime decompositions of radicals in polynomial rings
- The calculation of radical ideals in positive characteristic
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Usage of modular techniques for efficient computation of ideal operations
- Computing and using minimal polynomials
- A Direttissimo Algorithm for Equidimensional Decomposition
- Computing with algebraically closed fields
- Ideals modulo a prime
- Title not available (Why is that?)
- An efficient algorithm for factoring polynomials over algebraic extension field
Uses Software
This page was built for publication: Implementation of prime decomposition of polynomial ideals over small finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643560)
