Optimal Sample Exponents for Direct Discrete-Gaussian SVP Search on Haar Random Lattices 4JCFPV48VG

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Shortest length bounds	statement	lemma 2.2	arxiv
Success exponent for ordinary Gaussian draws	statement	theorem 4.5	arxiv
Approximate adaptive queries	statement	corollary 5.3	arxiv
Balanced width comparison	statement	proposition 4.1	arxiv
Uniform Gaussian success exponent	statement	lemma 4.6	arxiv
Matching exponential rate of the finite converse	statement	corollary 4.8	arxiv
Optimal sample exponent for direct Gaussian search	statement	theorem 1.1	arxiv
Finite ordinary Gaussian success bounds	statement	theorem 6.1	arxiv
Generation cost needed to improve the benchmark	statement	corollary 5.2	arxiv
Primitive moments	statement	lemma 2.1	arxiv
Query budget and sampling error	statement	corollary 6.2	arxiv
Finite converse with primitive reduction	statement	theorem 4.7	arxiv
Thermal profile and visibility	statement	lemma 2.5	arxiv
Draw rate at the smoothing based width	statement	corollary 5.1	arxiv
Visibility and the subcritical success exponent	statement	theorem 3.1	arxiv
Finite adaptive query converse	statement	corollary 6.3	arxiv
Uniform partition estimate	statement	lemma 2.3	arxiv
Acceptance probability of primitive conditioning	statement	theorem 4.4	arxiv
Transfer to all nonzero vectors	statement	corollary 4.3	arxiv
A deterministic primitive comparison	statement	proposition 4.2	arxiv