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

Patterned self-assembly tile set synthesis () aims at minimizing the number of distinct DNA tile types used to self-assemble a given rectangular color pattern. For an integer , - is the subproblem of  that restricts input patterns to those with at most  colors. We give an efficient  verifier, and based on that, we establish a manually-checkable proof for the -hardness of 11-; the best previous manually-checkable proof is for 29-.

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis