stacs 2021 | improved (provable) algorithms for the shortest vector problem via…
Published 3 years ago • 132 plays • Length 26:30Download video MP4
Download video MP3
Similar videos
-
24:21
stacs 2021 | round-competitive algorithms for uncertainty problems with parallel queries
-
23:55
stacs 2021 | a unified framework of quantum walk search
-
1:07:35
stacs 2021 | optimization, complexity and invariant theory
-
21:09
stacs 2021 | parameterised counting in logspace
-
29:45
stacs 2021 | exploiting dense structures in parameterized complexity
-
16:19
stacs 2021 | finding an optimal alphabet ordering for lyndon factorization is hard
-
24:16
stacs 2021 | a nearly optimal deterministic online algorithm for non-metric facility location
-
24:52
stacs 2021 | quantum approximate counting with nonadaptive grover iterations
-
19:49
tsp #195 - teardown, repair & experiments with an agilent 8163a lightwave multimeter & laser modules
-
52:38
a tutorial on quantum approximate optimization algorithm (oct 2020). part 1: theory
-
1:09:17
neurosat: learning a sat solver from single-bit supervision
-
25:54
stacs 2021 | the edit distance to k-subsequence universality
-
25:31
stacs 2021 | on euclidean steiner 1 ε-spanners
-
24:39
stacs 2021 | a framework of quantum strong exponential-time hypotheses
-
16:15
stacs 2021 | resolution with symmetry rule applied to linear equations
-
31:06
stacs 2021 | binary matrix completion under diameter constraints
-
23:31
qip 2022 | improved classical and quantum algorithms for the shortest vector ... (rajendra kumar)
-
17:44
improved classical and quantum algorithms for subset-sum
-
21:36
aistats 2012: classifier cascade for minimizing feature evaluation cost