Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On the Compressibility of NP Instances and Cryptographic Applications
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Invitation to data reduction and problem kernelization
ACM SIGACT News
On Parameterized Path and Chordless Path Problems
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On Problems without Polynomial Kernels (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Subexponential time and fixed-parameter tractability: exploiting the miniaturization mapping
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Discrete Optimization
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation
Hi-index | 0.00 |
We first present a method to rule out the existence of strong polynomial kernelizations of parameterized problems under the hypothesis P $\ne$ NP. This method is applicable, for example, to the problem Sat parameterized by the number of variables of the input formula. Then we obtain improvements of related results in [1,6] by refining the central lemma of their proof method, a lemma due to Fortnow and Santhanam. In particular, assuming that PH $\ne \Sigma^{\rm {P}}_3$, i.e., that the polynomial hierarchy does not collapse to its third level, we show that every parameterized problem with a "linear OR" and with NP-hard underlying classical problem does not have polynomial reductions to itself that assign to every instance x with parameter k an instance y with |y | = k O (1)·|x |1 *** *** (here *** is any given real number greater than zero).