Erschienen: 06.11.1998 Abbildung von Downey / Fellows | Parameterized Complexity | 1998

Downey / Fellows

Parameterized Complexity

lieferbar ca. 10 Tage als Sonderdruck ohne Rückgaberecht

ca. 192,59 €

inkl. Mwst.

1998. Buch. xv, 533 S. Bibliographien. Hardcover

Springer. ISBN 978-0-387-94883-6

Format (B x L): 15,5 x 23,5 cm

Gewicht: 2100 g

In englischer Sprache

Das Werk ist Teil der Reihe: Monographs in Computer Science

Produktbeschreibung

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.

Autoren

  • Dieses Set enthält folgende Produkte:
      Auch in folgendem Set erhältlich:
      • nach oben

        Ihre Daten werden geladen ...