Birs- 13w5010: Computational Complexity
-
Title: Information complexity and exact communication bounds
Speaker:
Link:
-
Title: Direct Products in Communication Complexity
Speaker:
Link:
-
Title: Communication Lower Bounds Using Directional Derivatives
Speaker:
Link:
-
Title: Communication is bounded by root of rank
Speaker:
Link:
-
Title: Association schemes, non-commutative polynomial tail estimates, and Lasserre lower bounds for planted clique
Speaker:
Link:
-
Title: The Complexity of the Comparator Circuit Value Problem
Speaker:
Link:
-
Title: Approximate constraint satisfaction requires large LP relaxations
Speaker:
Link:
-
Title: Succinct Computational Integrity and Privacy Research (SCIPR)
Speaker:
Link:
-
Title: A Characterization of Strong Approximation Resistance
Speaker:
Link:
-
Title: Non-commutative extensions of Grothendieck’s inequality
Speaker:
Link:
-
Title: Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
Speaker:
Link:
-
Title: Pseudorandom Generators via Mild Pseudorandom Restrictions
Speaker:
Link:
-
Title: Pseudorandomness from Shrinkage
Speaker:
Link:
-
Title: Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions
Speaker:
Link:
-
Title: Locally Testable Codes and Derandomized Hypercubes
Speaker:
Link:
-
Title: Limits of local algorithms
Speaker:
Link:
-
Title: Rounding group actions: examples
Speaker:
Link:
-
Title: Analytical Approach to Parallel Repetition
Speaker:
Link:
-
Title: Uniform Circuit Complexity
Speaker:
Link: