Computational Complexity: A Quantitative Perspective

Langue : anglais

Edité par Elsevier Science and Technology, GB, 2004

0444828419 / 9780444828415

Vendeur : Rarewaves.com USA, London, London, Royaume-UniRarewaves.com USA

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 11 juin 2025

Afficher les articles de ce vendeur
Livre relié

Etat: Neuf

EUR 226,27

 Frais de port gratuits 
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier
Retours gratuits sous 30 jours

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.

N° de réf. du vendeur LU-9780444828415

Titre
Computational Complexity: A Quantitative Perspective
Auteur
Marius Zimand
Éditeur
Elsevier Science and Technology, GB
Année de publication
2004
État de l'article
New
Reliure
Hardback
Langue
anglais
ISBN à 10 chiffres
0444828419
ISBN à 13 chiffres
9780444828415
Poids de l'article
680 grammes

Rarewaves.com USA

London, London, Royaume-Uni

Vendeur avec une évaluation de 5 étoiles

Vendeur AbeBooks depuis 11 juin 2025

Frais d'expédition de Royaume-Uni vers Etats-Unis

Article9 à 14 jours ouvrés9 à 14 jours ouvrés
Premier articleEUR 0,00EUR 0,00
Les délais de livraison sont fixés par les vendeurs et varient en fonction du transporteur et du lieu. Les commandes transitant par les douanes peuvent être retardées et les acheteurs sont responsables de tous les droits ou frais associés. Les vendeurs peuvent vous contacter au sujet de frais supplémentaires afin de couvrir toute augmentation des coûts d'expédition de vos articles.

Modes de paiement

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

Profil professionnel du vendeur

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Royaume-Uni W1W 8BE