Funder
Russian Science Foundation
Publisher
Springer Science and Business Media LLC
Reference78 articles.
1. Dadush, D.: Integer programming, lattice algorithms, and deterministic volume estimation. Georgia Institute of Technology, ProQuest Dissertations Publishing, Ann Arbor (2012)
2. Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via m-ellipsoid coverings. In: 2011 IEEE 52nd annual symposium on foundations of computer science, pp. 580–589 (2011). https://doi.org/10.1109/FOCS.2011.31
3. Dadush, D.: On approximating the covering radius and finding dense lattice subspaces. In: Proceedings of the 51st Annual ACM SIGACT symposium on theory of computing, pp. 1021–1026 (2019). https://doi.org/10.1145/3313276.3316397
4. Regev, O., Stephens-Davidowitz, N.: A reverse minkowski theorem. In: Proceedings of the 49th Annual ACM SIGACT symposium on theory of computing, pp. 941–953 (2017)
5. Reis, V., Rothvoss, T.: The subspace flatness conjecture and faster integer programming. In: 2023 IEEE 64th Annual symposium on foundations of computer science (FOCS), IEEE. pp. 974–988 (2023)