Square-free algorithms in positive characteristic

DOI10.1007/BF01613611zbMATH Open0874.12009DBLPjournals/aaecc/GianniT95OpenAlexW1969237032WikidataQ59620084 ScholiaQ59620084MaRDI QIDQ1908897FDOQ1908897

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

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

zbMATH Keywords

decidabilitypolynomialsfields of positive characteristicsquare-free decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• A course in constructive algebra
• Effective procedures in field theory
• Title not available (Why is that?)
• Constructions in Algebra
• Title not available (Why is that?)
• Constructions in a Polynomial Ring Over the Ring of Integers
• Title not available (Why is that?)
• Construction of the integral closure of a finite integral domain

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
• Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
• Fast separable factorization and applications
• 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)