zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Computational complexity. (English) Zbl 0833.68049
Amsterdam: Addison-Wesley Publishing Company. xv, 523 p. US$ 40.95 /hc (1994).

The book contains an introduction to the complexity theory at the graduate level. It describes in a comprehensive way such issues as: problems and algorithms, Turing machines as a universal model of computations, logic (Boolean, first-order and second-order) as the most important application to be studied. Then complexity classes are discussed in detail, starting with relations between them and including the concept of completeness (in class P and NP). Later NP-complete problems are described together with proof methodology. Class of co-NP problems, randomized computations and cryptography are discusses in a sequel. This part of the book is complemented by a discussion of approximability and the basic question “N=NP?” including intermediate degrees, isomorphism and density, and oracles.

The next part of the book discusses the detailed structure of class P, concentrating on parallel algorithms and logarithmic space complexity.

Finally, several complexity issues concerned with problems beyond class NP are analyzed. They include polynomial hierarchy, polynomial space and a discussion of exponential time complexity. Summing up, the book is well written and requires almost no mathematical prerequisites. Its main drawback is that it leaves the main question “P=NP?” still open.

68Q15Complexity classes of computation
03D15Complexity of computation
03D10Turing machines and related notions
68-01Textbooks (computer science)
68Q05Models of computation (Turing machines, etc.)