scientific article; zbMATH DE number 3974286

MaRDI QIDQ3740227zbMATH OpenFDO

Authors Julian A Padget, James H. Davenport

Publication date 1985

zbMATH Keywords

\({bbfZ}\)-adic computationgreatest common divisor of polynomialsinequalities

Mathematics Subject Classification ID

PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06) Software, source code, etc. for problems pertaining to field theory (12-04) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Simulation beats richness: new data-structure lower bounds
• scientific article; zbMATH DE number 7053310
• Bypassing UGC from some optimal geometric inapproximability results
• A data-driven McMillan degree lower bound
• Data reductions and combinatorial bounds for improved approximation algorithms
• Reducing Computational Costs in the Basic Perturbation Lemma
• Bit-probe lower bounds for succinct data structures
• Bit-probe lower bounds for succinct data structures

Cited in

(4)

• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
• A deterministic algorithm for finding \(r\)-power divisors
• scientific article; zbMATH DE number 1254256 (Why is no real title available?)
• Certifying irreducibility in \(\mathbb{Z}[x]\)

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 Q3740227)