Concept

Asymptotic computational complexity

Related lectures (27)

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Parallel Programming in Scala: Performance Analysis

Delves into the performance analysis of parallel programs in Scala, covering asymptotic analysis, recursive functions, and Amdahl's Law.

Subquadratic Attention Mechanisms: State Space Models Overview

Covers subquadratic attention mechanisms and state space models, focusing on their theoretical foundations and practical implementations in machine learning.

Computation & Algorithms I

Explores algorithm complexity, time complexity estimation, Landau notations, and asymptotic behavior analysis.

Algorithm Design: Time Complexity Analysis

Introduces algorithm design and time complexity analysis using examples and notations like n² and O(n).

Optimization: Classical Problems

Covers classical optimization problems, brute force algorithms, and integer linear optimization.

Efficiency of Algorithms

Explores the efficiency of algorithms and the impact of complexity on computation time.

Maximum Subarray Problem

Covers the Master method, maximum-subarray problem, and divide-and-conquer algorithmic paradigm.

Introduction to Logarithm

Covers the introduction to logarithms, algorithmic notations, and analysis of algorithm travel times.

Algorithmic Complexity: Travel Time Analysis

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

P vs NP: Complexity Theory

Delves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.

Ruelle resonances for geodesic flow

Explores Ruelle resonances for geodesic flows on non-compact manifolds, emphasizing the role of smoothness and eigenvalues in the dynamics.

Introduction to Complexity

Introduces time complexity and worst-case analysis of algorithms, abstracting computational complexity from implementation details.

Introduction to Complexity

Introduces time complexity and worst-case analysis of algorithms, abstracting computational complexity from implementation details.

Complexity of Algorithms

Explores the complexity of algorithms, including big-O notation and efficiency analysis.

Dynamical System Theory for Engineers: Large Scale Stability

Covers the concept of large scale stability in dynamical systems.

Complexity Analysis of FGD Algorithm

Analyzes the complexity of the FGD algorithm in terms of computational and memory requirements.

Quantum Phase Estimation

Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.

Dynamic Programming: Knapsack

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Dynamical System Theory for Engineers: Large Scale Stability

Explores large scale stability in dynamical systems, emphasizing non-increasing trajectories and strict decrease of a specific function.