Lattices Without a Big Constant and With Noise

TL;DR

This paper presents a novel lattice-based approach to subset sum problems that eliminates large constants and flipping, and extends the method to noisy inputs, improving robustness and applicability.

Contribution

It introduces a new lattice analysis technique that removes the need for large constants and flipping, and adapts it for noisy data scenarios.

Findings

Elimination of large constants in lattice subset sum analysis

Successful application to noisy input data

Enhanced robustness of lattice methods

Abstract

We show how Frieze's analysis of subset sum solving using lattices can be done with out any large constants and without flipping. We apply the variant without the large constant to inputs with noise.