![NP-complete problems / Analysis of algorithms / Complexity classes / Parameterized complexity / Graph coloring / Dominating set / FO / Time complexity / Tree decomposition / Theoretical computer science / Computational complexity theory / Applied mathematics NP-complete problems / Analysis of algorithms / Complexity classes / Parameterized complexity / Graph coloring / Dominating set / FO / Time complexity / Tree decomposition / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/be0d7e32d68d392a8eea23132e3d3189.jpg) Date: 2006-07-04 06:02:43NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics | | Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . IntroductionAdd to Reading ListSource URL: homepages.inf.ed.ac.ukDownload Document from Source Website File Size: 121,06 KBShare Document on Facebook
|