Parameterized Complexity
Buch in deiner Nähe kaufen
Beschreibung
This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This will be suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory.
This book presents an approach to complexity theory which offers a means of analyzing algorithms in terms of their tractability Downey considers problems in terms of parameterized languages and taking "k-slices" of the language, giving readers insight into new classes of algorithms which may be analyzed more precisely than before This book will be of great value to computer scientists and mathematicians interested in the design and analysis of algorithms
Autor*in
Rodney G. Downey
Themen in »Parameterized Complexity«
Algorithms Automat Graph algorithm automata classification complexity complexity theory optimization combinatorics algorithm analysis and problem complexity