Computational Complexity: A Quantitative Perspective

Lingua: inglese

Editore: Elsevier Science and Technology, GB, 2004

0444828419 / 9780444828415

Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Visualizza gli articoli di questo venditore
Rilegato

Condizione: Nuovo

EUR 221,43

EUR 75,63 spedizione 
Spedito da Regno Unito a U.S.A.

Quantità: Più di 20 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

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.

Codice articolo LU-9780444828415

Titolo
Computational Complexity: A Quantitative Perspective
Autore
Marius Zimand
Editore
Elsevier Science and Technology, GB
Anno di pubblicazione
2004
Condizione
New
Rilegatura
Hardback
Lingua
inglese
ISBN 10
0444828419
ISBN 13
9780444828415
Peso dell'articolo
680 grammi

Rarewaves.com UK

London, Regno Unito

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Tariffe di spedizione da Regno Unito a U.S.A.

ArticoloDa 60 a 60 giorni lavorativiDa 60 a 60 giorni lavorativi
Primo articoloEUR 75,63EUR 116,36
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

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

Informazioni sull’azienda del venditore

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Regno Unito W1W 8BE