Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · Electronic Notes in Theoretical Computer Science · 2002

Parameterized Complexity

Michael R. Fellows

Cited by 2,884Open access

Abstract

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking k-slices of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.

Cite this paper

APA 7

Fellows, M. R. (2002). Parameterized Complexity. Electronic Notes in Theoretical Computer Science, 61, 1–19. https://doi.org/10.1016/s1571-0661(04)00301-9

MLA 9

Fellows, Michael R. “Parameterized Complexity.” Electronic Notes in Theoretical Computer Science, vol. 61, 2002, pp. 1–19, https://doi.org/10.1016/s1571-0661(04)00301-9.

Chicago

Fellows, Michael R. 2002. “Parameterized Complexity.” Electronic Notes in Theoretical Computer Science 61: 1–19. https://doi.org/10.1016/s1571-0661(04)00301-9.

Harvard

Fellows, M.R. (2002) ‘Parameterized Complexity’, Electronic Notes in Theoretical Computer Science, 61, pp. 1–19. Available at: https://doi.org/10.1016/s1571-0661(04)00301-9.

BibTeX
@article{fellows2002parameterized,
  title = {{Parameterized Complexity}},
  author = {Fellows, Michael R.},
  journal = {Electronic Notes in Theoretical Computer Science},
  volume = {61},
  pages = {1--19},
  year = {2002},
  doi = {10.1016/s1571-0661(04)00301-9}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers