Start date cannot be after end date.
When and How are (promise) Constraint Satisfaction Problems Efficiently Solvable?
Presenter
- Venkatesan Guruswami
October 21, 2024
IAS
Algorithms for Solving Random and Semirandom Planted Constraint Satisfaction Problems
Presenter
- Peter Manohar
October 7, 2025
IAS
Improved Fault-Tolerant Non-Clifford Gates (or: How to Multiply Quantumly)
Presenter
- Louis Golowich
March 3, 2025
IAS
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
Presenter
- Sivakanth Gopi
March 30, 2020
IAS
Bypassing UGC From Some Optimal Geometric Inapproximability Results
Presenter
- Rishi Saket
February 8, 2011
IAS
