Catalog Record: Complexity of computations and proofs

Navigation

Tools

Complexity of computations and proofs / edited by Jan Krajíček.

Other Authors:	Krajíček, Jan.
Language(s):	English
Published:	Roma (Italy) : Aracne, 2004, c2003.
Series:	Quaderni di matematica ;
Subjects:	Computational complexity. Proof theory. Coding theory. Kolmogorov complexity. Cryptography.
Physical Description:	424 p. : ill. ; 22 cm.
Original Format:	Book
Original Classification Number:	QA 267.7 .C6645 2004
ISBN:	8879994131
Locate a Print Version:	Find in a library

Viewability:

Limited (search only) (original from University of Michigan)

Catalog Search
Bibliographic search (Title, Author, Subject, ISBN/ISSN, Publisher, Series Title, or Year of Publication) of all HathiTrust items

Experimental Search
Full-text search of a small subset of HathiTrust items

Build & View Custom Collections

Go to Public Collections to browse other people's collections. Items from these collections can be copied into your own private collection.

Create your own Private Collection by searching or browsing to find items of interest and then adding them to a collection.

Full-text searching is available within public or private collections, and within individual items.

Close

Search Tips

Phrase Searching

Use quotes to search an exact phrase: e.g. "occult fiction"

Wildcards

Use * or ? to search for alternate forms of a word. Use * to stand for several characters, and ? for a single character: e.g. optim* will find optimal, optimize or optimum; wom?n will find woman and women.

Boolean Searching

Use AND and OR between words to combine them with Boolean logic: e.g. (heart OR cardiac) AND surgery will find items about heart surgery or cardiac surgery. Boolean terms must be in uppercase.