Lattices Without a Big Constant and With Noise

04/26/2022
by   Steven J. Gortler, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2020

Diophantine problems related to the Omega constant

Some diophantine problems are stated for the Omega constant and, more ge...
research
01/17/2023

Subset Sum in Time 2^n/2 / poly(n)

A major goal in the area of exact exponential algorithms is to give an a...
research
01/11/2022

Approximating Subset Sum Ratio via Subset Sum Computations

We present a new FPTAS for the Subset Sum Ratio problem, which, given a ...
research
03/20/2022

Subset Sum in O(n^16log(n))

This extensive revision of my paper "Description of an O(poly(n)) Algori...
research
03/05/2022

Why Constant-Composition Codes Reduce Nonlinear Interference Noise

A time-domain perturbation model of the nonlinear Schrodinger equation i...
research
02/09/2020

Edge-Isoperimetric Inequalities and Ball-Noise Stability: Linear Programming and Probabilistic Approaches

Let Q_n^r be the r-power of the hypercube {-1,1}^n. The discrete edge-is...
research
09/10/2020

Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality

Non-signaling strategies are a generalization of quantum strategies that...

Please sign up or login with your details

Forgot password? Click here to reset