# Theory of Computation (TOC) Seminar

 Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM ComputationTuesday, December 13, 2022 - 4:00pm to 5:15pmAbstract. TBA NP-Hardness of Learning Programs and Partial MCSPTuesday, December 6, 2022 - 4:00pm to 5:15pmAbstract. In his seminal paper on the theory of NP-complet Maximum Flow and Minimum-Cost Flow in Almost-Linear TimeTuesday, November 29, 2022 - 4:00pm to 5:15pmAbstract. We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Algorithms Should Have Bullshit Detectors! (or Polynomial Time Byzantine Agreement with Optimal Resilience)Tuesday, November 22, 2022 - 4:00pm to 5:15pmAbstract. One thing that distinguishes (theoretical) compu Almost Chor-Goldreich Sources and Adversarial Random WalksTuesday, October 25, 2022 - 4:15pm to 5:15pm The Conscious Turing Machine (CTM): A Theoretical CS Approach to the Hard ProblemTuesday, March 15, 2022 - 4:15pm to 5:15pm Efficient Verification of Computation on Untrusted PlatformsTuesday, March 8, 2022 - 4:00pm to 5:15pmEfficient verification of computation is fundamental to computer science, and is at the heart of t Merav Parter: New Diameter Reducing Shortcuts: Breaking the $O(\sqrt{n})$ BarrierTuesday, December 7, 2021 - 4:00pm to 5:00pm Subhash Khot: On Approximability of CSPs on Satisfiable InstancesTuesday, November 30, 2021 - 4:00pm to 5:00pmABSTRACT: Constraint Satisfaction Problems (CSPs) are among the most well-studied problems in Computer Science, 3SAT being a prominent example. Sanjoy Dasgupta: Some excursions into interpretable machine learningTuesday, November 23, 2021 - 4:00pm to 5:00pmThe need for int