Smoothing Out Binary Linear Codes and Worst-Case Sub-exponential Hardness for LPN.
Yu YuJiang ZhangPublished in: CRYPTO (3) (2021)
Keyphrases
- worst case
- np hard
- linear complexity
- double exponential
- upper bound
- computational complexity
- average case
- approximation algorithms
- greedy algorithm
- lower bound
- linear systems
- error bounds
- logical operations
- binary valued
- error correcting codes
- error correcting
- hamming distance
- curve fitting
- non binary
- feature selection
- running times
- piecewise constant
- multi class
- space complexity
- error correction
- learning theory
- phase transition
- closed form