Lower bounds for kernelizations and other preprocessing procedures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5635 LNCS, Issue , 2009, Pages 118-128

  Chen, Yijia ^a   Flum, Jörg ^b   Müller, Moritz ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Kernelization; Parameterized complexity; Preprocessing

Indexed keywords

CLASSICAL PROBLEMS; KERNELIZATION; LOWER BOUNDS; NP-HARD; PARAMETERIZED; PARAMETERIZED COMPLEXITY; PARAMETERIZED PROBLEMS; POLYNOMIAL HIERARCHIES; POLYNOMIAL REDUCTION; PROOF METHODS; REAL NUMBER; THIRD LEVEL;

COMPUTATIONAL COMPLEXITY; NUMBER THEORY;

POLYNOMIALS;

EID: 76249096645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03073-4_13     Document Type: Conference Paper

References (13)

1. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563-574. Springer, Heidelberg (2008)
2. Chang, R., Kadin, Y.: On computing boolean connectives of characteristic functions. Math. Systems Theory 28, 173-198 (1995)
3. Chen, Y., Flum, J.: On parameterized path and chordless path problems. In: Proceedings of the 22nd IEEE Conference on Computational Complexity (CCC 2007), pp. 250-263 (2007)
4. Chen, Y., Flum, J.: Subexponential time and fixed-parameter tractability: exploiting the miniaturization mapping. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 389-404. Springer, Heidelberg (2007)
5. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
6. Fortnow, L., Santhanam: Infeasibility of instance compression and succinct PCPs for NP. In: Proceedings of the 40th ACM Symposium on the Theory of Computing (STOC 2008), pp. 133-142. ACM, New York (2008)
7. Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic 130, 3-31 (2004)
8. Grandjean, E., Kleine-Büning, H.: SAT-problems and reductions with respect to the number of variables. Journal of Logic and Computation 7(4), 457-471 (1997)
9. Grohe, M.: Private communication (2008)
10. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1) (2007)
11. Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 719-728 (2006)
12. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63, 512-530 (2001)
13. Johnson, D.: Announcements, updates, and greatest hits. Journal of Algorithms 8(3), 438-448 (1987)