Pages that link to "Item:Q1606967"
From MaRDI portal
The following pages link to Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (Q1606967):
Displayed 16 items.
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- A note on BDD problems with \(\lambda_2\)-gap (Q2350585) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design (Q3011916) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- (Q5091027) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Algorithmic Problems for Metrics on Permutation Groups (Q5448642) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem (Q6123830) (← links)