BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Computational Complexity

Computational Complexity

Computational Complexity
Stock photo: cover may vary

Computational Complexity Hardback -

by Oded Goldreich

Add to wish list
  • New
  • Hardback
New

Description

Cambridge University Press CUP , pp. xxiv + 606 . Hardback. New.
Ask the seller a question Add to wish list
A$187.33
A$5.79 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Computational Complexity
  • Author Oded Goldreich
  • Binding Hardback
  • Edition First edition
  • Condition New
  • Pages 632
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press CUP , Cambridge
  • Publication date pp. xxiv + 606
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # 6534558
  • ISBN 9780521884730 / 052188473X
  • Weight 2.76 lbs (1.25 kg)
  • Dimensions 10.13 x 7.02 x 1.6 in (25.73 x 17.83 x 4.06 cm)
  • Category Computers - General Information
  • Library of Congress subjects Computational complexity, Turing machines
  • Library of Congress Catalogue Number 2008006750
  • Dewey Decimal Code 511.352
  • Quantity available 1

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Summary

Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers.

Reader reviews for Computational Complexity

From the publisher

This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.
tracking-