Abstract
We propose a general approach to modelling algorithmic paradigms for the exact solution of NPhard problems. Our approach is based on polynomial time reductions to succinct versions of problems solvable in polynomial time. We use this viewpoint to explore and compare the power of paradigms such as branching and dynamic programming, and to shed light on the true complexity of various problems.
As one instantiation, we model branching using the notion of witness compression, i.e., reducibility to the circuit satisfiability problem parameterized by the number of variables of the circuit. We show this is equivalent to the previously studied notion of `OPPalgorithms', and provide a technique for proving conditional lower bounds for witness compressions via a constructive variant of ANDcomposition, which is a notion previously studied in theory of preprocessing. In the context of parameterized complexity we use this to show that problems such as Pathwidth and Treewidth and Independent Set parameterized by pathwidth do not have witness compression, assuming NP subseteq coNP/poly. Since these problems admit fast fixed parameter tractable algorithms via dynamic programming, this shows that dynamic programming can be stronger than branching, under a standard complexity hypothesis. Our approach has applications outside parameterized complexity as well: for example, we show if a polynomial time algorithm outputs a maximum independent set of a given planar graph on n vertices with probability exp(n^{1epsilon}) for some epsilon>0, then NP subseteq coNP/poly. This negative result dims the prospects for one very natural approach to subexponential time algorithms for problems on planar graphs.
As two other illustrations (more exploratory) of our approach, we model algorithms based on inclusionexclusion or group algebras via the notion of "parity compression", and we model a subclass of dynamic programming algorithms with the notion of "disjunctive dynamic programming". These models give us a way to naturally classify various parameterized problems with FPT algorithms. In the case of the dynamic programming model, we show that Independent Set parameterized by pathwidth is complete for this model.
BibTeX  Entry
@InProceedings{drucker_et_al:LIPIcs:2016:6387,
author = {Andrew Drucker and Jesper Nederlof and Rahul Santhanam},
title = {{Exponential Time Paradigms Through the Polynomial Time Lens}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {36:136:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770156},
ISSN = {18688969},
year = {2016},
volume = {57},
editor = {Piotr Sankowski and Christos Zaroliagis},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6387},
URN = {urn:nbn:de:0030drops63871},
doi = {10.4230/LIPIcs.ESA.2016.36},
annote = {Keywords: exponential time paradigms, branching, dynamic programming, lower bounds}
}
Keywords: 

exponential time paradigms, branching, dynamic programming, lower bounds 
Collection: 

24th Annual European Symposium on Algorithms (ESA 2016) 
Issue Date: 

2016 
Date of publication: 

18.08.2016 