YoVDO

Computational Complexity Courses

Parameterized Inapproximability of the Minimum Distance Problem over All Fields
Simons Institute via YouTube
Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
Simons Institute via YouTube
Constant Query Local Decoding Against Deletions Is Impossible
Simons Institute via YouTube
Fundamental Limits to Quantum Computation
Simons Institute via YouTube
Probing the Limits of Classical Computing with Arbitrarily Connected Quantum Circuits
Simons Institute via YouTube
Learning Shallow Quantum Circuits and Quantum States in Polynomial Time
Simons Institute via YouTube
A Quantum Speed-Up for Approximating the Top Eigenvector of a Matrix via Improved Tomography
Simons Institute via YouTube
The Virtues of the Quantum Approximate Optimization Algorithm
Simons Institute via YouTube
Classical Algorithm for Simulating Experimental Gaussian Boson Sampling
Simons Institute via YouTube
Local Weak Convergence for Random Constraint Satisfaction Problems
Institute for Pure & Applied Mathematics (IPAM) via YouTube
< Prev Page 18 Next >