68Q25 Analysis of algorithms and problem complexity

MSC > 68Qxx Theory of computing > 68Q25 Analysis of algorithms and problem complexity

Videos linked to 68Q25 Analysis of algorithms and problem complexity

01:24:53

published on August 7, 2025

Optimization problem on quantum computers - lecture 2

By Yassine Hamoudi

01:26:29

published on August 7, 2025

Optimization problem on quantum computers - lecture 1

By Yassine Hamoudi

01:09:23

published on April 15, 2025

Meta-complexity - Lecture 3

By Antonina Kolokolova

01:11:52

published on April 14, 2025

Meta-complexity - Lecture 2

By Antonina Kolokolova

01:13:33

published on April 14, 2025

Meta-complexity - Lecture 1

By Antonina Kolokolova

01:27:52

published on March 25, 2024

Designing and exploiting fast algorithms for univariate polynomial matrices - Lecture 2

By Vincent Neiger

01:27:53

published on March 25, 2024

Designing and exploiting fast algorithms for univariate polynomial matrices - Lecture 1

By Vincent Neiger

published on September 25, 2023

Efficient approximation of polynomials

By Guillaume Moroz

More +

Copyright Carmin.tv 2025

Give feedback