Bøger af Rodney G. Downey

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields.

This text covers the state of the art in multivariate algorithmics and complexity, a vital field with countless applications in modern computing. It describes the latest methods of proving parameterized tractability, including powerful lower-bound techniques.

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.