Articoli correlati a Computational Complexity: A Modern Approach
Sinossi
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.
Informazioni sugli autori
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.
Compra nuovo
Visualizza questo articolo
EUR 62,52
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Computational Complexity: A Modern Approach
Foto dell'editore
Computational Complexity: A Modern Approach
Editore:
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Antico o usato
Rilegato
Da: medimops, Berlin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. Codice articolo M00521424267-G
Quantità: 2 disponibili
Foto dell'editore
Computational Complexity: A Modern Approach
Editore:
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Antico o usato
Rilegato
Da: SecondSale, Montgomery, IL, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: Good. Item in good condition and has highlighting/writing on text. Used texts may not contain supplemental items such as CDs, info-trac etc. Codice articolo 00089432930
Quantità: 2 disponibili
Foto dell'editore
Computational Complexity: A Modern Approach
Editore:
Cambridge University Press, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Antico o usato
Rilegato
Da: Marlton Books, Bridgeton, NJ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Acceptable. Readable, but has significant damage / tears. Has a remainder mark. hardcover Used - Acceptable 2009. Codice articolo AB-002713
Quantità: 1 disponibili
Immagini fornite dal venditore
Computational Complexity
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Gebunden. Condizione: New. 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 tha. Codice articolo 5918908
Quantità: 2 disponibili
Foto dell'editore
Computational Complexity
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9780521424264
Quantità: 2 disponibili
Foto dell'editore
Computational Complexity
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9780521424264
Quantità: 3 disponibili
Immagini fornite dal venditore
Computational Complexity
Editore:
Cambridge University Pr. Mai 2009, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Nuovo
Rilegato
Da: Wegmann1855, Zwiesel, Germania
Valutazione del venditore 2 su 5 stelle
Buch. Condizione: Neu. Neuware -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. Codice articolo 9780521424264
Quantità: 1 disponibili
Immagini fornite dal venditore
Computational Complexity
Editore:
Cambridge University Pr. Mai 2009, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Nuovo
Buch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Neuware -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. 579 pp. Englisch. Codice articolo 9780521424264
Quantità: 1 disponibili
Immagini fornite dal venditore
Computational Complexity
Editore:
Cambridge University Pr. Mai 2009, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Nuovo
Rilegato
Da: Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Neuware -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. 579 pp. Englisch. Codice articolo 9780521424264
Quantità: 1 disponibili
Immagini fornite dal venditore
Computational Complexity
Editore:
Cambridge University Pr. Mai 2009, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Neuware -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.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld 579 pp. Englisch. Codice articolo 9780521424264
Quantità: 2 disponibili