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.
"synopsis" may belong to another edition of this title.
Oded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an Incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity and previously authored the books Modern Cryptography, Probabalistic Proofs and Pseudorandomness and the two-volume work Foundations of Cryptography.
"About this title" may belong to another edition of this title.
FREE shipping within U.S.A.
Destination, rates & speedsSeller: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condition: Fair. 1. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 052188473X-7-1
Quantity: 1 available
Seller: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condition: Very Good. 1. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 052188473X-8-1
Quantity: 1 available
Seller: Textbooks_Source, Columbia, MO, U.S.A.
hardcover. Condition: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 000937790U
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Seller Inventory # 5576965-5
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 5576965
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 5576965-n
Quantity: 1 available
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9780521884730
Quantity: 1 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2416190020280
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521884730
Quantity: Over 20 available
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Hardcover. Condition: new. Hardcover. 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. A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521884730
Quantity: 1 available