arXiv (All)
open access
A New Sparse Algorithm for Polynomial GCD over Integers
We describe a new greatest common divisor (GCD) algorithm for polynomials with integer coefficients. The bit complexity of the new algorithm is polynomial in the input and output sizes and the individual degree bounds.Our algorithm follows the standard approach by reducing multivariate polynomial GC
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sparse Polynomial GCD Algorithms Asymptotically Linear in All Fundamental Parameters#985466
- Sparse Approximation via Polynomial Equations#998763
- Arithmetic pseudo-Frobenius numbers and determinantal numerical semigroup rings#1144185
- Ten unknowns for Hilbert's tenth problem over the integers#924670
- Ten unknowns for Hilbert's tenth problem over the integers#920436
Record · ID 997628
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive