Pages that link to "Item:Q2922519"
From MaRDI portal
The following pages link to Complexity of lattice problems. Non-approximability and limits of non-approximability (Q2922519):
Displaying 6 items.
- On the lattice programming gap of the group problems (Q1785637) (← links)
- Extension of Hoshen-Kopelman algorithm to non-lattice environments (Q1867874) (← links)
- On the complexity of computing short linearly independent vectors and short bases in a lattice (Q2819600) (← links)
- (Q3096713) (← links)
- Lattice problems in NP ∩ coNP (Q3546284) (← links)
- Inapproximability Results for Computational Problems on Lattices (Q5188550) (← links)