scientific article; zbMATH DE number 1263394

zbMATH Open0921.11073MaRDI QIDQ4234285

Mark J. Encarnación

Publication date: 29 September 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

algebraic number fieldmodular algorithmdenominator boundgcd of two univariate polynomialsmodular residue

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials (irreducibility, etc.) (11R09)

Related Items (8)

Computing GCDs of polynomials over algebraic number fields ⋮ On computation of the greatest common divisor of several polynomials over a finite field. ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Algorithms for polynomial GCD computation over algebraic function fields ⋮ Fundamentals of Computation Theory ⋮ Title not available (Why is that?) ⋮ A polynomial time algorithm for computing the HNF of a module over the integers of a number field

Uses Software

• Title not available (Why is that?)

This page was built for publication:

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