capturing one-way functions via np-hardness of meta-complexity
Published Streamed 1 year ago • 504 plays • Length 46:45Download video MP4
Download video MP3
Similar videos
-
45:15
np-hardness of approximating meta-complexity: a cryptographic approach
-
46:26
np-hardness of approximating meta-complexity: a cryptographic approach
-
1:03:11
proof complexity and meta-complexity tutorial (1)
-
49:40
low-complexity cryptography and simple hard-to-learn functions
-
1:02:00
analyzing average-case complexity by meta-complexity
-
42:52
constant-round arguments from one-way functions
-
58:21
intro to meta-complexity: part 1
-
1:29:55
the autodidactic universe & string theory | stephon alexander
-
9:06
quantum gravity
-
9:24
tesla turbine | the interesting physics behind it
-
53:20
the quest for hardness of metacomplexity: progress, barriers, and next steps (part i)
-
56:20
proof complexity and meta-complexity tutorial (2)
-
1:01:15
kolmogorov complexity for meta-complexity for theoreticians
-
11:50
one-way functions imply secure computation in a quantum world
-
19:41
on average-case hardness in tfnp from one-way functions
-
59:35
richard m. karp distinguished lecture — how difficult is it to certify that a random sat formula is
-
1:03:11
minimal complexity assumptions for cryptography (part i)
-
54:40
p, np and proof complexity
-
40:37
one-way functions imply secure computation in a quantum world