The Lost Continent of Polynomial Time: Preprocessing and Kernelization

  • Michael R. Fellows
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4169)


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.


Polynomial Time Vertex Cover Parameterized Problem Theoretical Computer Science Complexity Framework 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michael R. Fellows
    • 1
  1. 1.School of Electrical Engineering and Computer ScienceUniversity of NewcastleCallaghanAustralia

Personalised recommendations