Birs- 19w5088: Algebraic Techniques in Computational Complexity

  1. Title:
    Explicit near-Ramanujan graphs of every degree

    Speaker:

    Link:

  2. Title:
    Nearly Optimal Pseudorandomness From Hardness

    Speaker:

    Link:

  3. Title:
    Pseudorandomness from the Fourier Spectrum

    Speaker:

    Link:

  4. Title:
    Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas

    Speaker:

    Link:

  5. Title:
    Factors of sparse polynomials: structural results and some algorithms

    Speaker:

    Link:

  6. Title:
    Sylvester-Gallai Type Theorems for Quadratic Polynomials

    Speaker:

    Link:

  7. Title:
    Efficient Construction of Rigid Matrices Using an NP Oracle

    Speaker:

    Link:

  8. Title:
    Query-to-Communication lifting using low-discrepancy gadgets

    Speaker:

    Link:

  9. Title:
    The Log-Approximate-Rank Conjecture is False

    Speaker:

    Link:

  10. Title:
    The sunflower conjecture and connections to TCS

    Speaker:

    Link:

  11. Title:
    Private hypothesis selection

    Speaker:

    Link:

  12. Title:
    Criticality and decision-tree size of regular AC^0 functions

    Speaker:

    Link:

  13. Title:
    Reconstructing arithmetic formulas using lower bound proof techniques

    Speaker:

    Link:

  14. Title:
    Tensor Isomorphism: completeness, graph-theoretic methods, and consequences for Group Isomorphism

    Speaker:

    Link: