Computational Complexity: A Quantitative Perspective

Idioma: inglés

Editorial: Elsevier Science and Technology, GB, 2004

0444828419 / 9780444828415

Librería: Rarewaves.com USA, London, London, Reino UnidoRarewaves.com USA

Vendedor de 5 estrellas

Vendedor de AbeBooks desde 11 de junio de 2025

Ver los artículos de este vendedor
Tapa dura

Condición: Nuevo

EUR 226,27

 Gastos de envío gratis 
Se envía de Reino Unido a Estados Unidos de America

Cantidad disponible: Más de 20 disponibles

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

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 ref. del artículo LU-9780444828415

Título
Computational Complexity: A Quantitative Perspective
Autor
Marius Zimand
Editorial
Elsevier Science and Technology, GB
Año de publicación
2004
Estado
New
Encuadernación
Hardback
Idioma
inglés
ISBN 10
0444828419
ISBN 13
9780444828415
Peso del artículo
680 gramos

Rarewaves.com USA

London, London, Reino Unido

Vendedor de 5 estrellas

Vendedor de AbeBooks desde 11 de junio de 2025

Tarifas de envío de Reino Unido a Estados Unidos de America

ArtículoDe 9 a 14 días hábilesDe 9 a 14 días hábiles
Primer artículoEUR 0,00EUR 0,00
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

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

Información empresarial del vendedor

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Reino Unido W1W 8BE