Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Parameterized Complexity

Showing: 14 courses
GERAD Research Center

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

0 rewiews
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.
Add to list
1 Lesons
50 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

0 rewiews
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.
Add to list
1 Lesons
58 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

A Quick and Partial Survey on the Complexity of Query Answering

0 rewiews
Explore the complexity of query answering in this survey, covering key concepts and recent developments in discrete mathematics and logic.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Hausdorff Center for Mathematics

Sparse Integer Programming Is FPT

0 rewiews
Explore sparse integer programming's fixed-parameter tractability, its implications for parameterized complexity, and related concepts in variable dimension optimization.
Add to list
7 Lesons
35 minutes
On-Demand
Free-Video
Applied Algebraic Topology Network

Parameterized Complexity of Quantum Invariants of Knots

0 rewiews
Explore quantum invariants of knots, their parameterized complexity, and efficient algorithms for computation using graphical calculus and tree embeddings.
Add to list
9 Lesons
50 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Introduction to Parameterized Algorithms and Applications

0 rewiews
Explore parameterized complexity and its applications in discrete optimization, focusing on LP-guided techniques, Lenstra's algorithm, and structured ILPs using Graver bases.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Introduction to Parameterized Algorithms, Lecture I

0 rewiews
Gentle introduction to parameterized complexity, focusing on basic techniques like branching, color coding, and kernelization. Explores connections to linear programming and discrete optimization.
Add to list
1 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Recent Hardness of Approximation Results in Parameterized Complexity

0 rewiews
Survey of recent hardness of approximation results in parameterized complexity, focusing on k-clique problem inapproximability, with technical insights and open problems discussion.
Add to list
1 Lesons
57 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Parametrized Algorithms and Possible Future Directions

0 rewiews
Explore current research and future directions in Parameterized Complexity, focusing on algorithmic approaches and potential areas for further investigation.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Hausdorff Center for Mathematics

Michal Pilipczuk: Introduction to Parameterized Algorithms, Lecture II

0 rewiews
Explore parameterized complexity, focusing on LP-related methods. Learn branching, color coding, kernelization, and dynamic programming techniques for algorithm design and optimization.
Add to list
1 Lesons
1 hour 9 minutes
On-Demand
Free-Video
Simons Institute

Parameterized Inapproximability of the Minimum Distance Problem over All Fields

0 rewiews
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.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
ACM SIGPLAN

The Complex(ity) Landscape of Checking Infinite Descent

0 rewiews
Explore the complexity of checking Infinite Descent in cyclic proof systems, examining various criteria and their parameterized time complexities to improve automatic verification techniques.
Add to list
1 Lesons
18 minutes
On-Demand
Free-Video
IEEE

A Parameterized Approximation Scheme for Min k-Cut

0 rewiews
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.
Add to list
12 Lesons
21 minutes
On-Demand
Free-Video
Squid: Schools for Quantum Information Development

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

0 rewiews
Delve into parameterized complexity of weighted local Hamiltonian problems, exploring quantum states, Hamming weight constraints, and their implications for quantum computational theory.
Add to list
16 Lesons
22 minutes
On-Demand
Free-Video