Concept
Computational complexity
Related lectures (429)
Algorithmic Complexity: Definition and Examples
Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.
Coin Rendering: Part 1MOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Factoring Polynomials: Complexity and Algorithms
Delves into the complexity of factoring polynomials and the implications for security.
Integral Functions: Parameters and Uniform Convergence
Explores the challenges of integrating functions with parameters and the importance of uniform convergence.
Naive Bayes: Gaussian Discriminant Analysis
Covers the Naive Bayes assumption, Gaussian Discriminant Analysis, ML estimates, and Kernel trick.
Quantum circuit model of computation
Covers the Cincent Model of Deutsch for Quantum Computation, focusing on input representation, Hilbert space, and unitary evolution.
Complexity of Algorithms
Explores the complexity of algorithms, including big-O notation and efficiency analysis.
Integer Program Formulation
Covers the process of formulating integer programs and improving solutions.
Complexity of Algorithms
Covers the Big-O notation to analyze algorithm efficiency and provides examples of polynomial and factorial function estimates.
Decomposition: Evaluation and New Forms
Explores decomposition in programming through evaluating expressions and adding new forms, emphasizing object-oriented solutions and the trade-offs involved.