{"paper":{"title":"Parallel sparse interpolation using small primes","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Mohamed Khochtali, Xisen Tian","submitted_at":"2015-06-13T03:41:43Z","abstract_excerpt":"To interpolate a supersparse polynomial with integer coefficients, two alternative approaches are the Prony-based \"big prime\" technique, which acts over a single large finite field, or the more recently-proposed \"small primes\" technique, which reduces the unknown sparse polynomial to many low-degree dense polynomials. While the latter technique has not yet reached the same theoretical efficiency as Prony-based methods, it has an obvious potential for parallelization. We present a heuristic \"small primes\" interpolation algorithm and report on a low-level C implementation using FLINT and MPI."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04215","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}