Birs- 16w5044: Computational Complexity
-
Title: Recent advances in randomness extractors and applications
Speaker:
Link:
-
Title: Explicit Two-Source Extractors and Resilient Functions
Speaker:
Link:
-
Title: Alternating Extraction, and its applications to Non-Malleable Extractors
Speaker:
Link:
-
Title: Theory and applications of operator scaling (I)
Speaker:
Link:
-
Title: Theory and applications of operator scaling (II)
Speaker:
Link:
-
Title: The Formula Complexity of Subgraph Isomorphism
Speaker:
Link:
-
Title: What fraction of worst-case bit deletions are correctable?
Speaker:
Link:
-
Title: Sum of squares and computational bayesanism
Speaker:
Link:
-
Title: Polynomial-time tensor decomposition with sum-of-squares
Speaker:
Link:
-
Title: Strongly refuting random constraint satisfaction problems below the spectral threshold
Speaker:
Link:
-
Title: Exponential Lower Bounds for Monotone Computation by Algebraic Gaps
Speaker:
Link:
-
Title: Approximating CSPs requires sub-exponential size linear programs
Speaker:
Link:
-
Title: Candidate Hard Unique Game
Speaker:
Link:
-
Title: Proof complexity lower bounds from algebraic circuit complexity
Speaker:
Link:
-
Title: Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
Speaker:
Link:
-
Title: Learning algorithms from natural proofs
Speaker:
Link:
-
Title: Stronger Connections between Learning, Lower Bounds and Pseudorandomness
Speaker:
Link:
-
Title: A New Approach to Distribution Testing
Speaker:
Link:
-
Title: Structure of protocols for XOR functions
Speaker:
Link:
-
Title: The Reverse Minkowski Theorem
Speaker:
Link: