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/

Global: Zendy Tools annual

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

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We describe an algorithm for computing, for all primes $p \leq X$, themod-$p$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometricmotive in time quasilinear in $X$. This combines the Beukers--Cohen--Mellittrace formula with average polynomial time techniques of Harvey et al.

Hypergeometric L-functions in average polynomial time