Birs- 19w5088: Algebraic Techniques in Computational Complexity
-
Title: Explicit near-Ramanujan graphs of every degree
Speaker:
Link:
-
Title: Nearly Optimal Pseudorandomness From Hardness
Speaker:
Link:
-
Title: Pseudorandomness from the Fourier Spectrum
Speaker:
Link:
-
Title: Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas
Speaker:
Link:
-
Title: Factors of sparse polynomials: structural results and some algorithms
Speaker:
Link:
-
Title: Sylvester-Gallai Type Theorems for Quadratic Polynomials
Speaker:
Link:
-
Title: Efficient Construction of Rigid Matrices Using an NP Oracle
Speaker:
Link:
-
Title: Query-to-Communication lifting using low-discrepancy gadgets
Speaker:
Link:
-
Title: The Log-Approximate-Rank Conjecture is False
Speaker:
Link:
-
Title: The sunflower conjecture and connections to TCS
Speaker:
Link:
-
Title: Private hypothesis selection
Speaker:
Link:
-
Title: Criticality and decision-tree size of regular AC^0 functions
Speaker:
Link:
-
Title: Reconstructing arithmetic formulas using lower bound proof techniques
Speaker:
Link:
-
Title: Tensor Isomorphism: completeness, graph-theoretic methods, and consequences for Group Isomorphism
Speaker:
Link: