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
• On-Demand
• 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
• On-Demand
• Free Video

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
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• Free Video

Simons Institute

Optimization: Interior Point Methods - Part 1

Explore interior point methods for optimization with Stanford's Yinyu Ye, covering fundamental concepts and applications in data structures and fast algorithms.

• YouTube
• 1 hour 16 minutes
• On-Demand
• 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
• On-Demand
• Free Video

BIMSA

Polynomial Time Cryptanalytic Extraction of Neural Network Models

Explore polynomial-time techniques for extracting neural network parameters, improving upon previous methods and demonstrating practical efficiency on a CIFAR10 classifier.

• YouTube
• 1 hour 10 minutes
• On-Demand
• Free Video

Simons Institute

Learning Shallow Quantum Circuits and Quantum States in Polynomial Time

Efficient algorithms for learning shallow quantum circuits and states, extending to polylog depth. Key techniques involve reconstructing low-complexity quantum systems from local observables.

• YouTube
• 42 minutes
• On-Demand
• 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
• On-Demand
• 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
• On-Demand
• Free Video

BIMSA

Frame Matroids with a Distinguished Frame Element

Explore the characterization of 3-connected frame matroids with a fixed element in their frame, including graphical representations and recognition algorithms.

• YouTube
• 53 minutes
• On-Demand
• Free Video

Harvard CMSA

Tropicalized Quantum Field Theory

Discover a revolutionary approach to quantum field theory computations using tropicalization, enabling polynomial-time algorithms for previously intractable perturbative calculations.

• YouTube
• 1 hour 18 minutes
• On-Demand
• Free Video

Harvard CMSA

Efficient Mean Estimation with Pure Differential Privacy via Sum-of-Squares Exponential Mechanism

Dive into polynomial-time algorithms for mean estimation using Sum-of-Squares method, exploring pure differential privacy and efficient computational techniques in high-dimensional statistics.

• YouTube
• 18 minutes
• On-Demand
• Free Video

Centre International de Rencontres Mathématiques

Quantum Algorithms for Factorization and Other Problems - Lecture 1

Discover quantum algorithms for factorization, including the Quantum Fourier Transform and recent improvements by Regev, Ragavan, Vaikuntanathan, and others.

• YouTube
• 1 hour 13 minutes
• On-Demand
• Free Video