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.
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.
A Quick and Partial Survey on the Complexity of Query Answering
Explore the complexity of query answering in this survey, covering key concepts and recent developments in discrete mathematics and logic.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.