New Bounds on the Covering Density

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,800
Published on ● Video Link: https://www.youtube.com/watch?v=s_WRRVSM8ts


Duration: 51:35
732 views
5

Barak Weiss, Tel Aviv University
https://simons.berkeley.edu/talks/n-n-n-cube-and-hyperplane
Lattices: Geometry, Algorithms and Hardness



Other Videos By Simons Institute for the Theory of Computing


2020-02-20PPP-completeness with connections to Cryptography
2020-02-20Provable Sieving Algorithms for SVP and CVP in the l_p norm
2020-02-20Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes
2020-02-20On Minimal Support for Lattices and Semigroups
2020-02-20Integer Programming and Convolution, with Applications
2020-02-19On the Concrete Security of LWE with Small Secret
2020-02-19Challenges in Evaluating Costs of known Lattice Attacks
2020-02-19New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks
2020-02-19Algorithms for the k-List Problems
2020-02-19An LLL Algorithm for Module Lattices
2020-02-18New Bounds on the Covering Density
2020-02-18Short Simplex Paths in Lattice Polytopes
2020-02-18The n by n by n Cube and a Hyperplane
2020-02-18Successive Minima-Type Inequalities
2020-02-18A Reverse Minkowski Theorem
2020-01-31Random Circuit Sampling: Thoughts and Open Problems
2020-01-31Quantum Supremacy II
2020-01-31Quantum Supremacy I
2020-01-30Recent Advances in Zero-Knowledge Proofs in the Quantum Setting
2020-01-30Quantum Algorithms and Post-Quantum Cryptography
2020-01-29Authenticating Quantum States


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Barak Weiss
Lattices: Geometry Algorithms and Hardness