English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

To interpolate a supersparse polynomial with integer coefficients, twoalternative approaches are the Prony-based "big prime" technique, which actsover a single large finite field, or the more recently-proposed "small primes"technique, which reduces the unknown sparse polynomial to many low-degree densepolynomials. While the latter technique has not yet reached the sametheoretical efficiency as Prony-based methods, it has an obvious potential forparallelization. We present a heuristic "small primes" interpolation algorithmand report on a low-level C implementation using FLINT and MPI.

Parallel sparse interpolation using small primes