Computational complexity

This modern introduction to the Theory of Computer Science is the first unified introduction to Computational Complexity. I+ offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and meth...

 Data Complexity in Pattern Recognition

Machines capable of automatic pattern recognition have many fascinating uses in science and engineering as well as in our daily lives. Algorithms for supervised classification, where one infers a decision boundary from a set of training examples, are at t...

 Complexity and Cryptography An Introduction

Cryptography plays a crucial role in many aspects of today's world, from internet banking and ecommerce to email and web-based business processes. Understanding the principles on which it is based is an important topic that requires a knowledge of both co...

 Theory of Semi-Feasible Algorithms

This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, no...

 Logic and Complexity

Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, co...

 The Discrepancy Method Randomness and Complexity

The discrepancy method is the glue that binds randomness and complexity. It is the link between discrepancy theory, an area of mathematics concerned with irregularities in distributions, and the seemingly unrelated subject of randomized algorithms. The di...