|En la categoría:
¿Quieres vender uno?

Computational Complexity by Boaz & Sanjeev INTERNATIONAL EDITION

Check-inStore
(695)
Registrado como vendedor profesional
USD37,50
Aproximadamente32,09 EUR
Estado:
Nuevo
Último2 vendidos
¡Corre antes de que se agote! 1 usuario tiene este artículo en seguimiento.
Artículo popular. 2 ya se han vendido.
Envío:
USD3,99 (aprox. 3,41 EUR) FedEx International Economy from Abroad.
Ubicado en: LUCKNOW, UTTAR PRADESH, India
Debido a las políticas de EE. UU., las tarifas de importación correspondientes a este artículo deberán pagarse a la aduana o al transportista en el momento de la entrega. Más información
Entrega:
Entrega prevista entre el sáb. 6 sep. y el jue. 11 sep. a 94104
Las fechas previstas de entrega (se abre en una nueva ventana o pestaña) incluyen el tiempo de manipulación del vendedor, el código postal de origen, el código postal de destino y la hora de aceptación, y dependen del servicio de envío seleccionado y de que el pago se haya hecho efectivoel pago se haya hecho efectivo (se abre en una nueva ventana o pestaña). Los plazos de entrega pueden variar, especialmente en épocas de mucha actividad.
Devoluciones:
30 días para devoluciones. El comprador paga el envío de la devolución..
Pagos:
    Diners Club

Compra con confianza

Garantía al cliente de eBay
Si no recibes el artículo que has pedido, te devolvemos el dinero. Más informaciónGarantía al cliente de eBay - se abre en una nueva ventana o pestaña
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:294906131668
Última actualización el 29 may 2024 20:08:02 H.EspVer todas las actualizacionesVer todas las actualizaciones

Características del artículo

Estado
Nuevo: Libro nuevo, sin usar y sin leer, que está en perfecto estado; incluye todas las páginas sin ...
Features
International Edition
PRODUCT TYPE
INTERNATIONAL EDITION PAPERBACK
ISBN
9780521424264

Acerca de este producto

Product Identifiers

Publisher
Cambridge University Press
ISBN-10
0521424267
ISBN-13
9780521424264
eBay Product ID (ePID)
71669845

Product Key Features

Number of Pages
594 Pages
Publication Name
Computational Complexity : a Modern Approach
Language
English
Publication Year
2009
Subject
General, Data Processing
Type
Textbook
Author
Boaz Barak, Sanjeev Arora
Subject Area
Computers
Format
Hardcover

Dimensions

Item Height
1.5 in
Item Weight
98.1 Oz
Item Length
10.2 in
Item Width
7.3 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
2009-002789
Dewey Edition
22
Reviews
"This book by two leading theoretical computer scientists provides a comprehensive,insightful and mathematically precise overview of computational complexity theory, ranging from early foundational work to emerging areas such as quantum computation and hardness of approximation. It will serve the needs of a wide audience, ranging from experienced researchers to graduate students and ambitious undergraduates seeking an introduction to the mathematical foundations of computer science. I will keep it at my side as a useful reference for my own teaching and research." Richard M. Karp, University Professor, University of California at Berkeley, Pre-Publication Review: "This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource." Michael Sipser, MIT, author of Introduction to the Theory of Computation, "This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource." Michael Sipser, MIT, author of Introduction to the Theory of Computation, 'This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource.' Michael Sipser, MIT, , author of Introduction to the Theory of Computation, Pre-Publication Review: "Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field." Avi Wigderson, Professor, Institute for Advanced Study, Princeton, "Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field." Avi Wigderson, Professor, Institute for Advanced Study, Princeton, 'Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field.' Avi Wigderson, Professor, Institute for Advanced Study, Princeton, 'This book by two leading theoretical computer scientists provides a comprehensive, insightful and mathematically precise overview of computational complexity theory, ranging from early foundational work to emerging areas such as quantum computation and hardness of approximation. It will serve the needs of a wide audience, ranging from experienced researchers to graduate students and ambitious undergraduates seeking an introduction to the mathematical foundations of computer science. I will keep it at my side as a useful reference for my own teaching and research.' Richard M. Karp, University of California at Berkeley, "The reviewer's impressions are that this new textbook on computational complexity is available for a very attractive price and that on Amazon it may be verified that it has received very good reviews by several leaders in this field (Karp, Sipser, Wigderson)." Ulrich Tamm, Mathematical Reviews
Illustrated
Yes
Dewey Decimal
511.3/52
Table Of Content
Part I. Basic Complexity Classes: 1. The computational model - and why it doesn't matter; 2. NP and NP completeness; 3. Diagonalization; 4. Space complexity; 5. The polynomial hierarchy and alternations; 6. Boolean circuits; 7. Randomized computation; 8. Interactive proofs; 9. Cryptography; 10. Quantum computation; 11. PCP theorem and hardness of approximation: an introduction; Part II. Lower Bounds for Concrete Computational Models: 12. Decision trees; 13. Communication complexity; 14. Circuit lower bounds; 15. Proof complexity; 16. Algebraic computation models; Part III. Advanced Topics: 17. Complexity of counting; 18. Average case complexity: Levin's theory; 19. Hardness amplification and error correcting codes; 20. Derandomization; 21. Pseudorandom constructions: expanders and extractors; 22. Proofs of PCP theorems and the Fourier transform technique; 23. Why are circuit lower bounds so difficult?; Appendix A: mathematical background.
Synopsis
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included., This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem., This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.
LC Classification Number
QA267.7 .A76 2009

Descripción del artículo del vendedor

Información de vendedor profesional

Certifico que todas mis actividades de venta cumplirán todas las leyes y reglamentos de la UE.
Acerca de este vendedor

Check-inStore

95,7% de votos positivos8,1 mil artículos vendidos

Se unió el may 2018
Registrado como vendedor profesional
Welcome, we are just a message away for any info you need 24X7..............EXPRESS SHIPPING FOR USA CUSTOMERS with NO EXTRA COST.
Visitar tiendaContactar

Valoraciones detalladas sobre el vendedor

Promedio durante los últimos 12 meses
Descripción precisa
4.7
Gastos de envío razonables
4.6
Rapidez de envío
5.0
Comunicación
4.7

Votos de vendedor (819)

Todas las valoraciones
Positivas
Neutras
Negativas
  • -***o (3)- Votos emitidos por el comprador.
    Últimos 6 meses
    Compra verificada
    The textbook was in great condition and shipping was faster than expected. The value was amazing and I have no complaints. The text is authentic and official and the quality and appearance match those of others found in libraries and universities. The book came very protected and was wrapped in three different layers of protection and a carton box. I highly recommend this seller!
  • 6***a (19)- Votos emitidos por el comprador.
    Últimos 6 meses
    Compra verificada
    Came as advertised. Carefully packaged. Good value for money. Excellent service
  • v***g (1)- Votos emitidos por el comprador.
    Mes pasado
    Compra verificada
    I ordered from this seller because of the potential day I could received the package. They didn't ship my order until the last estimated day of arrival nearly two weeks after. I place my order. I reached out to them and received no response. I would not rely on them for a timely order.