Computational Complexity: A Quantitative Perspective

Language: English

Published by Elsevier Science and Technology, GB, 2004

0444828419 / 9780444828415

  • Hardcover
  • New
See all details

Seller: Rarewaves.com USA, London, London, United KingdomRarewaves.com USA

5-star seller

AbeBooks seller since June 11, 2025

View this seller's items
Hardcover

Condition: New

£ 194.46

 Free Shipping 
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket
Free 30-day returns

Item description from seller

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively.The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length.One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines.

Seller Inventory # LU-9780444828415

Title
Computational Complexity: A Quantitative Perspective
Author
Marius Zimand
Publisher
Elsevier Science and Technology, GB
Publication year
2004
Condition
New
Binding
Hardback
Language
English
ISBN 10
0444828419
ISBN 13
9780444828415
Item weight
680 grams

Rarewaves.com USA

London, London, United Kingdom

5-star seller

AbeBooks seller since June 11, 2025

Shipping rates from United Kingdom to U.S.A.

Item9 to 14 business days9 to 14 business days
First item£ 0.00£ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Seller's business information

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, United Kingdom W1W 8BE