The Exponential Time Hypothesis and the Parameterized Clique Problem

DOI10.1007/978-3-642-33293-7_4zbMath1374.68239OpenAlexW35149855MaRDI QIDQ4899237

Jörg Flum, Yijia Chen, Kord Eickmeyer

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Block interpolation: a framework for tight exponential-time counting complexity ⋮ Boolean functional synthesis: hardness and practical algorithms

This page was built for publication: The Exponential Time Hypothesis and the Parameterized Clique Problem