on approximating the covering radius and finding dense lattice subspaces
Published Streamed 4 years ago • 369 plays • Length 1:00:25Download video MP4
Download video MP3
Similar videos
-
31:42
on approximating the covering radius and finding dense lattice subspaces
-
30:38
on minimal support for lattices and semigroups
-
1:02:42
complexity of lattice problems
-
8:00
is quantum entanglement the holographic dual of a wormhole?
-
4:43
how to set spatially dependent materials
-
54:37
tom hartman - holographic duality for averaged free cfts
-
4:48
physics: optics ch 58.1 refracting surfaces (5 of 22) across a double flat boundary
-
1:08:25
the mathematics of lattices i
-
32:54
successive minima-type inequalities
-
1:00:18
a reverse minkowski theorem
-
37:07
tight bounds for volumetric spanners in all norms
-
1:03:56
discrepancy and approximation algorithms
-
47:32
parameterized inapproximability of the minimum distance problem over all fields...
-
18:42
provable sieving algorithms for svp and cvp in the l_p norm
-
1:09:29
when cryptography meets modern channel coding
-
56:58
reduction of singular riemannian foliations and how to detect boundary of the leaf space
-
1:18:04
preradicals in modular lattices with applications to grothendieck categories... (toma albu)
-
43:46
classical algorithms, correlation decay, and complex zeros of quantum partition functions
-
33:07
majorizing measures for the optimizer