Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#NP-completeness

Showing: 13 courses
NPTEL

Design & Analysis of Algorithms

1 rewiews
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Add to list
34 Lesons
1 day 6 hours
On-Demand
Free-Video
GERAD Research Center

Fixed-Parameter Tractability of Scheduling Dependent Tasks on m Machines Subject to Release Times and Deadlines

0 rewiews
Explore fixed-parameter tractability in scheduling dependent tasks on multiple machines with release times and deadlines. Gain insights into parameterized complexity and dynamic programming approaches.
Add to list
1 Lesons
50 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture

0 rewiews
Explorez les implications des hypothèses ETH sur la difficulté du problème SAT et ses conséquences en informatique théorique et complexité algorithmique.
Add to list
1 Lesons
58 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

How Hard is it to Solve This? - Computational Complexity in Problem Solving

0 rewiews
Explore problem-solving techniques in mathematics and statistics through lectures, hands-on sessions, and interactions with distinguished researchers. Gain broader exposure to key topics and enhance analytical skills.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
Institute for Advanced Study

When and How are Promise Constraint Satisfaction Problems Efficiently Solvable

0 rewiews
Delve into the mathematical foundations of Constraint Satisfaction Problems (CSP), exploring algorithmic efficiency, polymorphisms, and promise CSP applications in graph coloring and discrepancy minimization.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video
Kolmogorov-Seminar

PAC Learning: From Finite Families to CNF Formulas - Lecture on March 20, 2023

0 rewiews
Dive into PAC learning concepts, exploring finite families, conjunctions, k-CNFs, and NP-completeness in proper learning for 2-term CNF through advanced computational complexity theory.
Add to list
1 Lesons
2 hours 1 minute
On-Demand
Free-Video
Simons Institute

Oral History - Russell Impagliazzo in Conversation with Dick Karp

0 rewiews
Explore key developments in theoretical computer science through an engaging conversation between Russell Impagliazzo and Dick Karp, covering topics from NP-completeness to computational biology.
Add to list
16 Lesons
1 hour 24 minutes
On-Demand
Free-Video
Simons Institute

Beyond Worst-Case Analysis - Panel Discussion

0 rewiews
Experts discuss advanced algorithmic analysis, exploring beyond worst-case scenarios to improve efficiency and understanding in computer science and machine learning applications.
Add to list
14 Lesons
1 hour 10 minutes
On-Demand
Free-Video
Simons Institute

Berkeley in the 80s - Richard Karp and the Theory of Computing

0 rewiews
In-depth interview with Turing Laureate Richard Karp, exploring his groundbreaking research on computational theory at Berkeley in the 1980s and its lasting impact on computer science.
Add to list
1 Lesons
1 hour 24 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Computational Complexity in Theory and in Practice by Richard M. Karp

0 rewiews
Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.
Add to list
1 Lesons
1 hour 17 minutes
On-Demand
Free-Video
Ryan O'Donnell

Quantum Complexity - Quantum Computation at CMU

0 rewiews
Explore quantum complexity, error probabilities, and complexity classes in this advanced lecture on quantum computation and information theory.
Add to list
9 Lesons
1 hour 23 minutes
On-Demand
Free-Video
Simons Institute

Quantum Constraint Satisfaction - Richard M. Karp Distinguished Lecture

0 rewiews
Explore quantum Hamiltonian complexity, comparing it to classical constraint satisfaction. Learn about QMA-completeness, search-to-decision, dichotomy theorems, and coping with QMA-hardness in quantum applications.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
BIMSA

When and Why Do Efficient Algorithms Exist for Constraint Satisfaction and Beyond

0 rewiews
Explore the mathematical structures behind efficient algorithms for constraint satisfaction problems and beyond, focusing on polymorphisms and their role in computational complexity.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video