Closest Vector Problem
Find the lattice point closest to a target.
CVP · Haar-random lattices
Fix the target model, success probability and whether preprocessing is allowed
Results
| # | PUBLICATION / AUTHORS | DATE | TIME BOUND | SPACE BOUND | EVIDENCE |
|---|---|---|---|---|---|
| No checked result has been added for this comparison contract. | |||||
Comparison definition & assumptions
- Regime
- Fix the target model, success probability and whether preprocessing is allowed
- Computation
- Classical
- Rigor
- Provable
- Instances
- Haar random
- Cost scale
- 2^{c n + o(n)}
- Parameter
- n
- Description
- An open comparison category. Its rules must be fixed before adding comparable results.
- Comparison rules
- Record the exact parameter regime, cost unit, distribution and access assumptions. A source and BibTeX are required for new submissions. This template makes no claim to a universal exponent.
- Tags
- Haar-random, average-case, Euclidean