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

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The reviewed paper describes an analog device that empirically solves smallinstances of the NP-complete Subset Sum Problem (SSP). The authors claim thatthis device can solve the SSP in polynomial time using polynomial space, inprinciple, and observe no exponential scaling in resource requirements. Wepoint out that (a) the properties ascribed by the authors to their device areinsufficient to solve NP-complete problems in poly-time, (b) runtime analysisoffered does not cover the spectral measurement step, (c) the overall techniquerequires exponentially increasing resources when scaled up because of thespectral measurement step.

A review of "Mem-computing NP-complete problems in polynomial time using polynomial resources" (arXiv:1411.4798)