Algorithmic Problems for Metrics on Permutation Groups
From MaRDI portal
Publication:5448642
DOI10.1007/978-3-540-77566-9_12zbMath1133.68080OpenAlexW195565286MaRDI QIDQ5448642
Pushkar S. Joglekar, V. Arvind
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_12
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- On the limits of nonapproximability of lattice problems
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Hardness of approximating the minimum distance of a linear code
- A sieve algorithm for the shortest lattice vector problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithmic Problems for Metrics on Permutation Groups
