@inproceedings{94fe4f06bfb2405db10c29d32f6ea1d9,
title = "Verification of NP-Hardness Reduction Functions for Exact Lattice Problems",
abstract = "This paper describes the formal verification of NP-hardness reduction functions of two key problems relevant in algebraic lattice theory: the closest vector problem and the shortest vector problem, both in the infinity norm. The formalization uncovered a number of problems with the existing proofs in the literature. The paper describes how these problems were corrected in the formalization. The work was carried out in the proof assistant Isabelle.",
keywords = "NP-hardness, integer programming, lattice problems, verification",
author = "Katharina Kreuzer and Tobias Nipkow",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s).; Proceedings of the 29th International Conference on Automated Deduction, CADE-29 ; Conference date: 01-07-2023 Through 04-07-2023",
year = "2023",
doi = "10.1007/978-3-031-38499-8_21",
language = "English",
isbn = "9783031384981",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "365--381",
editor = "Brigitte Pientka and Cesare Tinelli",
booktitle = "Automated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings",
}