Parameterized complexity

Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 2 of 3

Understanding Complexity: Algorithms and NP Problems

Covers complexity classes, tractable problems, the class NP, NP-complete problems, and summarizes the concept of tractable problems.

Understanding Complexity: Tractable Problems and NP-Complete

Covers complexity classes, effect on computer time, tractable problems, class NP, and NP-complete problems.

Linear Algebra Complexity

Explores the complexity of linear algebra operations and optimization methods, including Gaussian elimination and the simplex method.

Complexity of Algorithms: Quiz + Answers

Covers the time complexity of algorithms and includes a quiz.

Dijkstra's Algorithm: All-Pairs

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

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.

Elements of Computational Complexity

Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.

Dynamic Programming: Solving Sequential Problems Efficiently

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

Challenges in Bit-Precise Reasoning

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