Abstract
One of the main objectives of the talk is to survey the history of the practical algorithmic strategy of preprocessing (also called data-reduction and kernelization) since the beginnings of computer science, and to overview what theoretical computer science has been able to say about it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fellows, M.R. (2006). The Lost Continent of Polynomial Time: Preprocessing and Kernelization. In: Bodlaender, H.L., Langston, M.A. (eds) Parameterized and Exact Computation. IWPEC 2006. Lecture Notes in Computer Science, vol 4169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847250_25
Download citation
DOI: https://doi.org/10.1007/11847250_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39098-5
Online ISBN: 978-3-540-39101-2
eBook Packages: Computer ScienceComputer Science (R0)