Publication:3305727

DOI10.4230/LIPIcs.FUN.2018.9zbMath1453.68091MaRDI QIDQ3305727

Hans L. Bodlaender, Tom C. van der Zanden

Publication date: 11 August 2020

zbMATH Keywords

exponential time hypothesis; exact complexity; polyomino packing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05B40: Combinatorial aspects of packing and covering

05B50: Polyominoes