Parameterized Complexity Courses and Certifications

Institute for Advanced Study

From PCPs to Parallel PCPs - Hardness of Approximation in Parameterized Complexity

Explore hardness of approximation in parameterized complexity, from PCPs to parallel PCPs, with insights on 2-CSP instances and the Exponential Time Hypothesis.

• YouTube
• 2 hours 1 minute
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Recent Hardness of Approximation Results in Parameterized Complexity

Survey of recent hardness of approximation results in parameterized complexity, focusing on k-clique problem inapproximability, with technical insights and open problems discussion.

• YouTube
• 57 minutes
• On-Demand
• Free Video

Applied Algebraic Topology Network

Parameterized Complexity of Quantum Invariants of Knots

Explore quantum invariants of knots, their parameterized complexity, and efficient algorithms for computation using graphical calculus and tree embeddings.

• YouTube
• 50 minutes
• On-Demand
• Free Video

Squid: Schools for Quantum Information Development

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis

Delve into parameterized complexity of weighted local Hamiltonian problems, exploring quantum states, Hamming weight constraints, and their implications for quantum computational theory.

• YouTube
• 22 minutes
• On-Demand
• Free Video

GERAD Research Center

Fixed-Parameter Tractability of Scheduling Dependent Tasks on m Machines Subject to Release Times and Deadlines

Explore fixed-parameter tractability in scheduling dependent tasks on multiple machines with release times and deadlines. Gain insights into parameterized complexity and dynamic programming approaches.

• YouTube
• 50 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Parametrized Algorithms and Possible Future Directions

Explore current research and future directions in Parameterized Complexity, focusing on algorithmic approaches and potential areas for further investigation.

• YouTube
• 1 hour
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Introduction to Parameterized Algorithms and Applications

Explore parameterized complexity and its applications in discrete optimization, focusing on LP-guided techniques, Lenstra's algorithm, and structured ILPs using Graver bases.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Michal Pilipczuk: Introduction to Parameterized Algorithms, Lecture II

Explore parameterized complexity, focusing on LP-related methods. Learn branching, color coding, kernelization, and dynamic programming techniques for algorithm design and optimization.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Introduction to Parameterized Algorithms, Lecture I

Gentle introduction to parameterized complexity, focusing on basic techniques like branching, color coding, and kernelization. Explores connections to linear programming and discrete optimization.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video

Simons Institute

Utilizing Structure in Combinatorial Solving and Reasoning

Efficient utilization of structure for combinatorial problem solving, focusing on treewidth measure and answer set programming. Explores runtime bounds, decomposition-guided reductions, and empirical results in hard reasoning modes.

• YouTube
• 40 minutes
• On-Demand
• Free Video

IEEE

A Parameterized Approximation Scheme for Min k-Cut

Explore a parameterized approximation scheme for the Min k-Cut problem, covering algorithms, research directions, and proof ingredients like tree decomposition and polynomial time analysis.

• YouTube
• 21 minutes
• On-Demand
• Conference Talk

Hausdorff Center for Mathematics

Sparse Integer Programming Is FPT

Explore sparse integer programming's fixed-parameter tractability, its implications for parameterized complexity, and related concepts in variable dimension optimization.

• YouTube
• 35 minutes
• On-Demand
• Free Video

ACM SIGPLAN

The Complex(ity) Landscape of Checking Infinite Descent

Explore the complexity of checking Infinite Descent in cyclic proof systems, examining various criteria and their parameterized time complexities to improve automatic verification techniques.

• YouTube
• 18 minutes
• On-Demand
• Free Video

Simons Institute

Parameterized Inapproximability of the Minimum Distance Problem over All Fields

Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.

• YouTube
• 48 minutes
• On-Demand
• Free Video

Centre International de Rencontres Mathématiques

Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture

Explorez les implications des hypothèses ETH sur la difficulté du problème SAT et ses conséquences en informatique théorique et complexité algorithmique.

• YouTube
• 58 minutes
• On-Demand
• Free Video