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 Plus annual

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

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We establish that the problem of computing a gcd-free basis for a set of polynomials is in AfC~ for any arbitrary field F. This leads to a proof that arithmetic for a simple algebraic extension is in N@. This result is applied to improve the complexity of the parallel deterministic algorithm to compute the Jordan normal form of a n dimensional matrix in time 0(log2 n).

NC2 computation of gcd-free basis and application to parallel algebraic numbers computation

NC² computation of gcd-free basis and application to parallel algebraic numbers computation