Polynomial Time Algorithm Courses and Certifications

Simons Institute

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

Explores polynomial-time classical algorithm for noisy random circuit sampling, challenging quantum supremacy claims. Discusses computational complexity, experimental implications, and recent progress in quantum computing.

• YouTube
• 1 hour 34 minutes
• Self-Paced
• Free Video

ACM SIGPLAN

Polynomial-time Classical Simulation of Roetteler's Shifted Bent Function Algorithm

Explore polynomial-time classical simulation of Roetteler's shifted bent function algorithm, examining symbolic rewriting techniques and their implications for quantum circuit analysis.

• YouTube
• 20 minutes
• Self-Paced
• Free Video

Computation in Complex Systems

Explore computational complexity from polynomial-time algorithms to NP-complete problems and undecidable challenges, bridging computer science with physics and biology applications.

• Complexity Explorer
• Self-Paced
• Free Certificate

GOTO Conferences

Quantum Computing in Action

Explore quantum computing's rise, its differences from classical computing, and why early adoption matters. Gain insights into quantum mechanics, simulators, and future implications.

• YouTube
• 42 minutes
• Self-Paced
• Conference Talk

Simons Institute

An Efficient Quantum Algorithm for Lattice Problems Achieving Subexponential Approximation Factor

Explore a groundbreaking quantum algorithm for lattice problems, offering subexponential approximation and exponential speedup over classical methods in polynomial time.

• YouTube
• 1 hour 7 minutes
• Self-Paced
• Free Video

International Mathematical Union

On the Complexity of Quantum Many Body Systems

Explores recent advancements in representing and computing ground states of 1D quantum systems efficiently using concepts from quantum computation and information theory.

• YouTube
• 1 hour 12 minutes
• Self-Paced
• Free Video

Insights into Mathematics

Computer Science is More Rigorous than Pure Maths - The Case for Certificates

Explore why Computer Science's certificate-based validation makes it more rigorous than Pure Mathematics, examining the P=NP problem and flaws in mathematical definitions.

• YouTube
• 14 minutes
• Self-Paced
• Free Video

Harvard CMSA

The P vs. NP Problem - An Existential Question for Mathematics

Explore the profound P vs NP problem and its implications for mathematics, computing, and automated proof search in this millennium prize lecture by Harvard's Madhu Sudan.

• YouTube
• 1 hour
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

Beating the Integrality Ratio for S-T-Tours in Graphs

Explores a novel algorithm for the s-t-path graph TSP, achieving a 1.497 approximation ratio and surpassing the known integrality ratio of 3/2 through innovative techniques.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video

IEEE

A Parameterized Approximation Scheme for Min k-Cut

Explore a parameterized approximation scheme for the Min k-Cut problem, covering algorithms, research directions, and proof ingredients like tree decomposition and polynomial time analysis.

• YouTube
• 21 minutes
• Self-Paced
• Conference Talk

Hausdorff Center for Mathematics

Algorithms for Rank-1 Bimatrix Games

Explore algorithms for solving rank-1 bimatrix games efficiently, including polynomial-time methods for finding Nash equilibria and path-following techniques. Discusses complexity, uniqueness, and parameterized approaches.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

A Market for Scheduling, with Applications to Cloud Computing

Explore a novel market model for resource allocation and scheduling, with applications to cloud computing. Learn about equilibrium computation and its challenges in this unique marketplace.

• YouTube
• 51 minutes
• Self-Paced
• Free Video

Institute for Mathematical Sciences

Set-limited Functions and Polynomial-time Interior-point Methods

Explore polynomial-time interior-point methods and set-limited functions with Yurri Nesterov, delving into advanced optimization techniques and mathematical theory.

• YouTube
• 48 minutes
• Self-Paced
• Free Video

Uncertainty in Artificial Intelligence

Revisiting Bayesian Network Learning with Small Vertex Cover

Explore Bayesian network structure learning with bounded vertex cover, analyzing complexity bounds and hardness results for optimization and counting problems.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

Simons Institute

Optimization: Interior Point Methods - Part 2

Explore advanced interior point methods for optimization, focusing on data structures and algorithms to enhance computational efficiency in solving complex problems.

• YouTube
• 49 minutes
• Self-Paced
• Free Video