Square-free algorithms in positive characteristic

DOI10.1007/BF01613611MaRDI QIDQ1908897zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Barry Trager, Patrizia Gianni

Publication date 19 May 1996

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01613611

zbMATH Keywords

decidabilitypolynomialsfields of positive characteristicsquare-free decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Derivations and radicals of polynomial ideals over fields of arbitrary characteristic
• Computation of the radical of polynomial ideals over fields of arbitrary characteristic
• On square-free factorization of multivariate polynomials over a finite field.
• Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
• scientific article; zbMATH DE number 5036652

Cites work

• scientific article; zbMATH DE number 3720908 (Why is no real title available?)
• scientific article; zbMATH DE number 3785035 (Why is no real title available?)
• scientific article; zbMATH DE number 3307642 (Why is no real title available?)
• A course in constructive algebra
• Construction of the integral closure of a finite integral domain
• Constructions in Algebra
• Constructions in a Polynomial Ring Over the Ring of Integers
• Effective procedures in field theory

Cited in

(12)

• On the optimality of lattices for the Coppersmith technique
• Computing the radical of an ideal in positive characteristic
• Derivations and radicals of polynomial ideals over fields of arbitrary characteristic
• Polynomials for the Jordan decomposition in characteristic p
• Implementation of prime decomposition of polynomial ideals over small finite fields
• Univariate polynomial factorization over finite fields
• Sampling polynomial trajectories for LTL verification
• On square-free factorization of multivariate polynomials over a finite field.
• Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
• Fast separable factorization and applications
• Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
• Square-free criteria for polynomials using no derivatives

This page was built for publication: Square-free algorithms in positive characteristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908897)