Parameterized complexity for the skeptic Export

@inproceedings{citeulike:566290, abstract = {The goal is to provide a tourist guide, with an eye towards structural issues, to what I consider some of the major highlights of parameterized complexity.}, author = {Downey, R.}, booktitle = {Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on}, citeulike-article-id = {566290}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1214417}, journal = {Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on}, keywords = {computability, computational\_complexity, parameterized\_complexity, set\_theory, trees, turing\_machines}, pages = {147--168}, posted-at = {2006-03-27 23:11:32}, priority = {0}, title = {Parameterized complexity for the skeptic}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1214417}, year = {2003} }

TY - CONF ID - citeulike:566290 L3 - citeulike-article-id:566290 N2 - The goal is to provide a tourist guide, with an eye towards structural issues, to what I consider some of the major highlights of parameterized complexity. JF - Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on EP - 168 TI - Parameterized complexity for the skeptic T2 - Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on SP - 147 KW - computability KW - computational_complexity KW - parameterized_complexity KW - set_theory KW - trees KW - turing_machines AU - Downey, R PY - 2003/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1214417 ER -