IMSc Library catalog › ISBD view

Normal view MARC view ISBD view

Melkebeek, Dieter van.

Randomness and completeness in computational complexity - Berlin, New York : Springer-Verlag c2000. - xv, 196 p. - Lecture notes in computer science ; 01950 .

ISBN: 3540414924

Subjects--Topical Terms:
Computer science
Mathematics.
Computational complexity.

Universal Decimal Class. No.: 681 LNCS

Print
Suggest for purchase
Save record
BIBTEX Dublin Core RIS MARC (Unicode/UTF-8, Standard)
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)