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

Concept

Space complexity

Related lectures (31)

Algorithmic Complexity: Travel Time Analysis

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

Distinct Elements: Count and Hash Functions

Covers counting distinct elements using hash functions and the median trick.

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.

Algorithmic Complexity: Definition and Examples

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

Implementation Research: Concepts and Scope

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

Improved Algorithm: Three-Color Parity Games

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

Untitled

Algorithmic Complexity: Theta Notation

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.

Complexity of Algorithms: Big-O Notation

Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.

Solving Parity Games in Practice

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

Recursion in Programming

Explores recursion in programming, discussing its benefits, challenges, and impact on algorithm complexity.

Introduction to Conditional Statements

In this lecture, you will learn to use conditional statements in Scratch to create interactive programs.

Complexity of Algorithms

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

Challenges in Bit-Precise Reasoning

Covers challenges in bit-precise reasoning, including SMT-COMP results, AIG, bit-blasting, Tseitin transformation, and complexity classes.

Implementation Strategies: Specifying and Operationalizing

Discusses a systematic approach for specifying and operationalizing implementation strategies.

Variational Method

Covers the variational method and its applications in solving mathematical problems.

Spin Glasses and Holography

Explores the connection between spin glasses and holography, focusing on disorder, the SYK model, and the quantum butterfly effect.

Complexity of Algorithms: Proofs of Big-O

Covers proofs of Big-O using witnesses and rules to analyze algorithm complexity.

Complexity of Algorithms: Big-O

Explains Big-O notation for algorithm complexity analysis through polynomial examples and growth rate identification.

Complexity of Algorithms: Growth of Functions

Analyzes the growth of functions to understand algorithm complexity and efficiency.