[图书][B] The complexity theory companion

LA Hemaspaandra, M Ogihara - 2013 - books.google.com
Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart
of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of …

[图书][B] Theory of computational complexity

DZ Du, KI Ko - 2011 - books.google.com
A complete treatment of fundamentals and recent advances in complexity theory Complexity
theory studies the inherent difficulties of solving algorithmic problems by digital computers …

[图书][B] Handbook of theoretical computer science (vol. A) algorithms and complexity

J Van Leeuwen - 1991 - dl.acm.org
The maturity of a field of research is probably best characterized by the existence of
handbooks that explain its problems, results, applications, and methodology; allow their …

Texts in Theoretical Computer Science An EATCS Series

A Board, GAMBCS Calude, ACDHJ Hartmanis… - 2005 - Springer
This book is an accessible introduction to complexity theory and cryptology, two closely
related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …

[PDF][PDF] Turing award lecture on computational complexity and the nature of computer science

J Hartmanis - Communications of the ACM, 1994 - dl.acm.org
and the Nature of Computer Science| n scientific work, the recognition by one's peers is one
of the greatest rewards. In particular, an official recognition by the scientific community, as …

[HTML][HTML] Computational complexity theory

W Dean - 2015 - plato.stanford.edu
Computational complexity theory is a subfield of theoretical computer science one of whose
primary goals is to classify and compare the practical difficulty of solving problems about …

[图书][B] Complexity: A very short introduction

JH Holland - 2014 - books.google.com
The importance of complexity is well-captured by Hawking's comment:" Complexity is the
science of the 21st century". From the movement of flocks of birds to the Internet …

[图书][B] Algorithmic adventures: From knowledge to magic

J Hromkovič - 2009 - books.google.com
The? rst and foremost goal of this lecture series was to show the beauty, depth and
usefulness of the key ideas in computer science. While working on the lecture notes, we …

Computability and Complexity

R Downey - 1997 - Springer
One of the great achievements of humanity has been the clarification of the concept of an
algorithmic process. Having done this, we then sought to understand the structure of …

[图书][B] Complexity theory: exploring the limits of efficient algorithms

I Wegener - 2005 - books.google.com
Complexity theory is the theory of determining the necessary resources for the solution of
algorithmic problems and, therefore, the limits of what is possible with the available …