on the complexity of computing roots and residuosity over finite fields - swastik kopparty
Published 8 years ago • 139 plays • Length 1:53:13Download video MP4
Download video MP3
Similar videos
-
57:29
the correlation of multiplicative characters with polynomials over finite fields - swastik kopparty
-
23:18
towards the classification of mvsps over finite fields
-
56:04
advances in linear sketching over finite fields
-
24:28
course presentation "modern tools for rational points on curves over finite fields"
-
34:40
pseudo-deterministic construction of irreducible polynomials over finite fields
-
26:14
swastik kopparty: fri and starks via an elliptic curve fast fourier transform (ecfft)
-
24:03
denis videla - on diagonal equations over finite fields via walks in neps of graphs
-
53:39
nathan kaplan, "codes from polynomials over finite fields"
-
40:36
nicholas katz: life over finite fields
-
56:57
"schemes of rational curves on del pezzo surfaces" by lucas das dores (impa)
-
1:06:23
cong xue: cohomology sheaves of stacks of shtukas
-
1:07:10
swastik kopparty @ theory lunch
-
2:03:23
affine dispersers from subspace polynomials - swastik kopparty
-
7:33
uniqueness theorem for finite fields
-
8:49
finite fields made easy
-
1:03:28
solvability of systems of polynomial equations over finite fields
-
26:38
aes ii - finite field ( galois field ) arithmetic for advanced encryption standard - cse4003
-
44:27
some pseudorandom phenomena in finite fields
-
28:51
finite fields 1
-
48:58
alena pirutka: algebraic cycles on varieties over finite fields