on the hardness of average-case k-sum
Published Streamed 2 years ago • 513 plays • Length 31:00Download video MP4
Download video MP3
Similar videos
-
58:50
average-case hardness in proof complexity
-
43:51
new techniques for proving fine-grained average-case hardness
-
1:02:50
average-case hardness of csps
-
47:50
unstructured hardness to average-case randomness
-
23:28
hardness of random 3xor and 3sat || @ cmu || lecture 26c of cs theory toolkit
-
1:19:23
21. 3sum and apsp hardness
-
45:19
algorithm design in the modern era: dealing with uncertainty and incentives
-
30:34
average-case hardness of np and ph from worst-case fine-grained assumptions
-
46:10
cryptography from sublinear-time average-case hardness of time-bounded kolmogorov complexity
-
34:36
clique is hard on average for unary sherali-adams
-
59:41
average-case complexity theory
-
19:10
on the cryptographic hardness of learning one-hidden layer neural networks
-
1:00:19
tcs talk: andrea lincoln (simons institute)
-
1:00:09
average-case complexity through the lens of interactive arguments
-
54:03
fine grained complexity
-
23:27
on the cryptographic hardness of finding a nash equilibrium
-
40:31
on the average-case complexity of the nearest boolean vector to a subspace
-
24:24
random max-csps inherit algorithmic hardness from spin glasses
-
47:52
average-case analysis for combinatorial problems featuring subset sums and stochastic spanning trees
-
44:41
noise vs imprecision in the hardness of random quantum circuits