Discrete Log Problem with Respect to the LPS generators on PGL_2

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=zvpMJE5a4_A


Duration: 47:15
675 views
0

Naser Talebizadeh Sardari, Princeton University
https://simons.berkeley.edu/talks/naser-talebizadeh-sardari-01-31-2017
Expanders and Extractors



Other Videos By Simons Institute for the Theory of Computing


2017-02-03Spectral Gaps and Geometric Representations
2017-02-03Finding and Using Expanders in Locally Sparse Graphs and in Sparse Random Graphs
2017-02-02Pseudorandomness When the Odds Are Against You
2017-02-02What are High-Dimensional Expanders?
2017-02-02Word-Measures on Unitary Groups
2017-02-02A Generalized Alon-Boppana Bound and Weak Ramanujan Graphs
2017-02-01Random Walks on Ramanujan Graphs, Digraphs and Complexes
2017-02-01High Dimensional Expanders
2017-01-31Super-Approximation
2017-01-31Golden Gates, Ramanujan Complexes and Ramanujan Digraphs
2017-01-31Discrete Log Problem with Respect to the LPS generators on PGL_2
2017-01-31High Dimensional Expanders and PCPs
2017-01-31Some of My Favorite Open Problems on Expanders and Extractors
2017-01-30Two Existence Proofs of Ramanujan Graphs
2017-01-30Ramanujan Covers
2017-01-30Extractors for Algebraic Sources
2017-01-30An Efficient Reduction from Non-Malleable Extractors to Two-Source Extractors, and...
2017-01-30Correlation Breakers, Independence-Preserving Mergers, and their Applications
2017-01-30Explicit Constructions of Two-Source Extractors and Ramsey Graphs
2017-01-27Natural Language Understanding: Foundations and State-of-the-Art
2017-01-27Tensor Decompositions for Learning Latent Variable Models II


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Expanders and Extractors
Naser Talebizadeh Sardari