30 titles from eBooks.com

Cambridge University Press (2009)

US$46.99

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

New and classical results in computational complexity, including interactive proofs, PCP,...

Cambridge University Press (2008)

US$64.99

A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate students.

A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate...

OUP Oxford (2014)

US$48.99

Scientific and philosophical literature on causality has become highly specialised. It is hard to find suitable access points for students, young researchers, or professionals outside this domain. This book provides a guide to the complex literature, explains the scientific problems of causality and the philosophical tools needed to address them.

Scientific and philosophical literature on causality has become highly specialised. It is hard to...

US$20.00

This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability...

This book is aimed at providing an introduction to the basic models of computability to the...

Springer Berlin Heidelberg (2007)

US$109.00

This book explains why complex systems research is important in understanding the structure, function and dynamics of complex natural and social phenomena. Readers will learn the basic concepts and methods of complex system research.

This book explains why complex systems research is important in understanding the structure,...

Cambridge University Press (1993)

US$50.50

These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics, Rutgers University.

These notes are based on a series of lectures given at the Advanced Research Institute of Discrete...

Springer Berlin Heidelberg (2006)

US$89.00

Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability. This book is...

Parameterized complexity theory is a recent branch of computational complexity theory that provides...

Cambridge University Press (1992)

US$37.99

Here Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The participants include many well known figures in the field.

Here Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function...

OUP Oxford (2009)

US$46.99

The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability. Both the basics and recent research results are desribed, providing a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory,...

The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting...

Elsevier Science (2004)

US$235.00

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a...

There has been a common perception that computational complexity is a theory of "bad news" because...