Fine-Grained Complexity and Algorithm Design Boot Camp
–
Fine-Grained Complexity and Algorithm Design Boot Camp
Details of Fine-Grained Complexity and Algorithm Design Boot Camp
Connections Between Algorithm Design and Complexity Theory
–
Connections Between Algorithm Design and Complexity Theory
Details of Connections Between Algorithm Design and Complexity Theory
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
–
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
Dániel Marx
(Hungarian Academy of Sciences (MTA SZTAKI))
Details of Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
Computational Complexity of Low-Polynomial Time Problems
–
Computational Complexity of Low-Polynomial Time Problems
Piotr Indyk
Piotr Indyk
(Massachusetts Institute of Technology)
Details of Computational Complexity of Low-Polynomial Time Problems
Fine-Grained Complexity and Algorithm Design Reunion
–
Fine-Grained Complexity and Algorithm Design Reunion
Dániel Marx
(Hungarian Academy of Sciences (MTA SZTAKI))
Details of Fine-Grained Complexity and Algorithm Design Reunion