Auteur: Rodney G. Downey

Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that bot …

This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having s …

The idea for this book was conceived over the second bottle of Villa Maria’s Caber- net Medot ’89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in …

The 7th and the 8th Asian Logic Conferences belong to the series of logic conferences inaugurated in Singapore in 1981. This meeting is held once every three years and rotates among countries in the …

This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models withi …

The 10th Asian Logic Conference is part of the series of logic conferences inaugurated in Singapore in 1981. This meeting is held every three years and rotates among countries in the Asia-Pacific reg …

The Asian Logic Conference is the most significant logic meeting outside of North America and Europe, and this volume represents work presented at, and arising from the 12th meeting. It collects a nu …

Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees. For strong notions of reducibility, such as $m$-deducibil …