![Analysis of algorithms / Parameterized complexity / Michael Fellows / Kernelization / Bidimensionality / Exponential time hypothesis / Time complexity / Complexity / FO / Theoretical computer science / Computational complexity theory / Applied mathematics Analysis of algorithms / Parameterized complexity / Michael Fellows / Kernelization / Bidimensionality / Exponential time hypothesis / Time complexity / Complexity / FO / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/ac6bbea28c5e30e092526c05cff9389a.jpg) Date: 2012-09-22 20:37:29Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Bidimensionality Exponential time hypothesis Time complexity Complexity FO Theoretical computer science Computational complexity theory Applied mathematics | | A quick summary of the field of Parameterized Complexity, 2012 Overview Parameterized Complexity is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic Add to Reading ListSource URL: fpt.wdfiles.comDownload Document from Source Website File Size: 72,86 KBShare Document on Facebook
|