![Complexity classes / NP-complete problems / Analysis of algorithms / Parameterized complexity / Kernelization / Vertex cover / Algorithm / Combinatorial optimization / FO / Theoretical computer science / Computational complexity theory / Applied mathematics Complexity classes / NP-complete problems / Analysis of algorithms / Parameterized complexity / Kernelization / Vertex cover / Algorithm / Combinatorial optimization / FO / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/94c6ac03bc5c215336f9cead54e6b097.jpg) Date: 2013-04-30 02:47:45Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Vertex cover Algorithm Combinatorial optimization FO Theoretical computer science Computational complexity theory Applied mathematics | | Welcome Frances Rosamond, Editor, Charles Darwin University Welcome to the Parameterized Complexity Newsletter. Congratulations to award winners and graduates. Note that the community wiki www.fpt.wikidot.com now has a TAdd to Reading ListSource URL: fpt.wdfiles.comDownload Document from Source Website File Size: 521,77 KBShare Document on Facebook
|