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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.D. from the University of California, Berkeley and has done foundational work in complexity theory, probabilistically checkable proofs, and approximation algorithms.
Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_475076065
Cantidad disponible: 1 disponibles
Librería: McCord Books, NORWALK, IA, Estados Unidos de America
hardcover. Condición: Good. Light cover and edge wear, few markings on text. Nº de ref. del artículo: 260212028
Cantidad disponible: 1 disponibles
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
Hardcover. Condición: Very Good. Nº de ref. del artículo: mon0004080446
Cantidad disponible: 2 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 6020661
Cantidad disponible: 1 disponibles
Librería: eCampus, Lexington, KY, Estados Unidos de America
Condición: New. Nº de ref. del artículo: N:9780521424264:ONHAND
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 6020661-n
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9780521424264
Cantidad disponible: Más de 20 disponibles
Librería: Rarewaves USA, HEBRON, KY, Estados Unidos de America
Hardback. Condición: New. 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. Nº de ref. del artículo: LU-9780521424264
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 6020661-n
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 6020661
Cantidad disponible: Más de 20 disponibles