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

This paper describes the formal verification of NP-hardness reductionfunctions of two key problems relevant in algebraic lattice theory: the closestvector problem and the shortest vector problem, both in the infinity norm. Theformalization uncovered a number of problems with the existing proofs in theliterature. The paper describes how these problems were corrected in theformalization. The work was carried out in the proof assistant Isabelle.

Verification of NP-hardness Reduction Functions for Exact Lattice Problems