Shortest Vector Problem
Find a shortest nonzero lattice vector.
Kissing-constant assumptions
Fix a uniform kissing/point-counting bound and its exponent β before comparing c(β)
Results
| # | PUBLICATION / AUTHORS | DATE | TIME BOUND | SPACE BOUND | EVIDENCE |
|---|---|---|---|---|---|
| No checked result has been added for this comparison contract. | |||||
Comparison definition & assumptions
- Regime
- Fix a uniform kissing/point-counting bound and its exponent β before comparing c(β)
- Computation
- Classical
- Rigor
- Conditional theorem
- Instances
- Arbitrary lattices
- Cost scale
- 2^{c n + o(n)}
- Parameter
- n
- Description
- A place for conditional time bounds parameterized by lattice point counting. Pin the exact β and theorem assumptions before entering numeric coefficients.
- 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
- kissing-constant assumption, point counting, arbitrary lattices, conditional, Euclidean