Square-free algorithms in positive characteristic

DOI10.1007/BF01613611zbMath0874.12009OpenAlexW1969237032WikidataQ59620084 ScholiaQ59620084MaRDI QIDQ1908897

Barry M. 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

polynomialsdecidabilityfields of positive characteristicsquare-free decomposition

Mathematics Subject Classification ID

Related Items (9)

Implementation of prime decomposition of polynomial ideals over small finite fields ⋮ Univariate polynomial factorization over finite fields ⋮ On square-free factorization of multivariate polynomials over a finite field. ⋮ Fast separable factorization and applications ⋮ Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case ⋮ On the optimality of lattices for the Coppersmith technique ⋮ Derivations and radicals of polynomial ideals over fields of arbitrary characteristic ⋮ Computing the radical of an ideal in positive characteristic ⋮ Sampling polynomial trajectories for LTL verification

Cites Work

• A course in constructive algebra
• Constructions in a Polynomial Ring Over the Ring of Integers
• Effective procedures in field theory
• Constructions in Algebra
• Construction of the integral closure of a finite integral domain
• Unnamed Item
• Unnamed Item
• Unnamed Item

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