Concept
P (complexity)
Related lectures (74)
Belief Propagation on Trees
Explores Belief Propagation on trees, discussing cavity marginals, message passing algorithms, and the computation of free entropy.
Dynamic Programming: Memoization and Bottom-Up Approach
Explores dynamic programming through memoization and a bottom-up approach to optimize recursive algorithms.
Complexity of Algorithms: Proofs of Time Complexity
Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.
Binary Search Trees: Operations and Implementations
Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.
Binary Search: Basics and ExecutionMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.
Quick Sort Analysis: Finding k Smallest
Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.
Algorithmes: introductionMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Covers the basics of algorithms, problem-solving, and efficient resolution methods.
Shor Algorithm: Circuit Details II
Explores the Shor algorithm circuit details for efficient number factoring using quantum computing.
Algorithms Midterm Exam: Solving 2019 Problems
Focuses on solving 2019 Algorithms Midterm Exam problems and analyzing time complexities.
Optimal Binary Search Trees
Explores optimal binary search trees to minimize search cost using dynamic programming and recursive formulations.