The following pages link to (Gap/S)ETH hardness of SVP (Q5230292):
Displayed 8 items.
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)