Pages that link to "Item:Q5240427"
From MaRDI portal
The following pages link to Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427):
Displaying 13 items.
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- (Q5091027) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- On compact representations of Voronoi cells of lattices (Q5918916) (← links)
- On Gaussian sampling, smoothing parameter and application to signatures (Q6595917) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
- Deciding whether a lattice has an orthonormal basis is in co-NP (Q6634539) (← links)
