Kernelization: an overview

Authors:
Daniel Lokshtanov
Affiliations:
University of California, San Diego, La Jolla, CA
Venue:
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Year:
2011

Citing 4
Cited 0

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
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

Journal of Computer and System Sciences
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

Kernelization is a mathematical framework for the study of polynomial time pre-processing. Over the last few years Kernelization has received considerable attention. In this talk I will survey the recent developments in the field, and highlight some of the interesting research directions.