New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condizione: 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! Codice articolo S_475076065
Quantità: 1 disponibili
Da: McCord Books, NORWALK, IA, U.S.A.
hardcover. Condizione: Good. Light cover and edge wear, few markings on text. Codice articolo 260212028
Quantità: 1 disponibili
Da: Books From California, Simi Valley, CA, U.S.A.
Hardcover. Condizione: Very Good. Codice articolo mon0004080446
Quantità: 4 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 6020661
Quantità: 1 disponibili
Da: eCampus, Lexington, KY, U.S.A.
Condizione: New. Codice articolo N:9780521424264:ONHAND
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 6020661-n
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521424264
Quantità: Più di 20 disponibili
Da: Rarewaves USA, HEBRON, KY, U.S.A.
Hardback. Condizione: 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. Codice articolo LU-9780521424264
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In English. Codice articolo ria9780521424264_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 6020661-n
Quantità: Più di 20 disponibili