Lectures related to Support Vector Machines: Formulation and Complexity

Algorithmic Complexity: Definition and Examples

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

Algorithmic Complexity: Travel Time Analysis

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

Solving Parity Games in Practice

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

Transition to Smart Cities: Complexity and Interdependencies

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

Computation & Algorithms II: Sorting and Recursive Algorithms

Explores sorting and recursive algorithms, including complexity analysis, maximal value, and binary search.

Dijkstra's Algorithm: All-Pairs

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Untitled

Theory of Computation: Countability and Undecidable Problems

Explores countability and undecidable problems in the theory of computation.

Simon Problem 4: Quantum State and Complexity Analysis

Explores the Simon Problem 4, analyzing quantum states and algorithm complexity.

Algorithmic Complexity: Visualization and Analysis

Explores algorithmic complexity, visualization of functions, and algorithm efficiency analysis using Python.

Theory of Computation: Decidability and Complexity

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

Complexity of Algorithms

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

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.

Algorithmic Complexity: Theta Notation

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

Implementation Research: Concepts and Scope

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

Algorithmic Complexity: Travel Time Analysis

Covers control operations, algorithmic complexity, function calls, and travel time analysis.

Elements of computational complexity

Covers classical and quantum computational complexity concepts and implications.

Factoring Polynomials: Complexity and Algorithms

Delves into the complexity of factoring polynomials and the implications for security.

Complexity of Algorithms: Quiz + Answers

Covers the time complexity of algorithms and includes a quiz.

Introduction to Conditional Statements

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