Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly

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


Duration: 17:30
121 views
1

Authors: Gillat Kol (Princeton University), Dmitry Paramonov (Princeton University); Raghuvansh Saxena (Microsoft Research); Huacheng Yu (Princeton University)
ITCS - Innovations in Theoretical Computer Science



Other Videos By Simons Institute for the Theory of Computing


2023-01-04Generalized Private Selection and Testing with High Confidence
2023-01-04All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method
2023-01-04Is it easier to count communities than find them?
2023-01-04Secure Distributed Network Optimization Against Eavesdroppers
2023-01-04Algorithms with More Granular Differential Privacy Guarantees
2023-01-04Graph Searching with Predictions
2023-01-04False Consensus, Information Theory, and Prediction Markets
2023-01-04Symmetric Formulas for Products of Permutations
2023-01-04Is it easier to count communities than find them?
2023-01-04Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds
2023-01-04Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly
2023-01-04Lifting to Parity Decision Trees Via Stifling
2023-01-04A subpolynomial-time algorithm for the free energy of one-dimensional...
2023-01-04An Algorithmic Bridge Between Hamming and Levenshtein Distances
2023-01-04An Improved Lower Bound for Matroid Intersection Prophet inequalities
2023-01-04Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations
2023-01-04The Strength of Equality Oracles in Communication
2023-01-04Private Counting of Distinct and k-Occurring Items in Time Windows
2023-01-04Clustering Permutations: New Techniques with Streaming Applications
2023-01-04Certificate games
2023-01-04Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS - Innovations in Theoretical Computer Science