arXiv (All)
open access
Sparse Polynomial GCD Algorithms Asymptotically Linear in All Fundamental Parameters
Let $A, B \in \mathbb{Z}[x_1, \dots, x_n]$ be multivariate polynomials with integer coefficients and let $G = \gcd(A, B)$. We present an algorithm for computing $G$ whose expected bit complexity is asymptotically linear in all fundamental parameters: the number of variables $n$, the term count $T =
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
- A New Sparse Algorithm for Polynomial GCD over Integers#997628
- Lower bounds for some value sets over finite fields: incidence geometry and Bourgain's group expansion theorem#972703
- Privacy-Preserving Computations on Sparse Data#124474
- Exponential Correlation Bounds for Polynomials#1076495
- Sparse Approximation via Polynomial Equations#998763
Record · ID 985466
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