Hostname: page-component-6bf8c574d5-b4m5d Total loading time: 0 Render date: 2025-02-28T14:29:54.394Z Has data issue: false hasContentIssue false
  • English
  • Français

J. Flum and M. Grohe. Parameterized complexity theory. Texts in Theoretical Computer Science. Springer, Berlin, 2006, xiii + 493 pp.

Published online by Cambridge University Press:  15 January 2014

Thomas Schwentick
Thomas Schwentick*
Affiliation:
University of Dortmund, Department of Computer Science, D-44221 Dortmund, Germany. thomas.schwentick@udo.edu.
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 13 , Issue 2 , June 2007 , pp. 246 - 248
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)