Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Computational complexity

Related lectures (30)

Algorithmic Complexity: Travel Time Analysis

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

Linear Systems: Convergence and Methods

Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.

Complexity of Algorithms

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

Statistical Physics of Clusters

Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.

Transition to Smart Cities: Complexity and Interdependencies MOOC: Smart Cities, Management of Smart Urban Infrastructures

Delves into the complexity and interdependencies of transitioning to smart cities, emphasizing the importance of a holistic approach.

Conclusions on Statistical Learning Theory

Explores conclusions from statistical learning theory, emphasizing function complexity, generalization, and the bias-variance trade-off.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Improved Algorithm: Three-Color Parity Games

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Distributed Quantum Computing

Explores communication complexity and quantum computation models in Distributed Quantum Computing.

Generalization in Deep Learning

Explores generalization in deep learning, covering model complexity, implicit bias, and the double descent phenomenon.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Algorithmic Complexity: Definition and Examples

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Learning from Probabilistic Models

Delves into challenges of learning from probabilistic models, covering computational complexity, data reconstruction, and statistical gaps.

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.

Implementation Research: Concepts and Scope

Explores Implementation Research, addressing challenges in implementing health interventions and developing effective strategies for infectious diseases of poverty.

Replica Symmetry Breaking: Full Solution & Condensation

Explores Replica Symmetry Breaking in the Random Energy Model, discussing configurational entropy and condensation.

Information, Computation, and Society

Explores the history and societal impact of information, communication, and computation sciences in the digital era.

Dynamic Programming: Solving Sequential Problems Efficiently

Explores dynamic programming for efficient problem-solving, illustrated with binomial coefficients and Pascal's triangle.