Da
World of Books (was SecondSale), Montgomery, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 20 dicembre 2007
Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Codice articolo 00086013916
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
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.
Titolo: Computational Complexity: A Modern Approach
Casa editrice: Cambridge University Press
Data di pubblicazione: 2009
Legatura: Rilegato
Condizione: Very Good
Da: Evergreen Goodwill, Seattle, WA, U.S.A.
hardcover. Condizione: Good. Codice articolo mon0000325644
Quantità: 1 disponibili
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_450733825
Quantità: 1 disponibili
Da: Marlton Books, Bridgeton, NJ, U.S.A.
Condizione: Acceptable. Readable, but has significant damage / tears. Has a remainder mark. hardcover Used - Acceptable 2009. Codice articolo AB-002713
Quantità: 1 disponibili
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condizione: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Codice articolo G0521424267I5N00
Quantità: 1 disponibili
Da: Wonder Book, Frederick, MD, U.S.A.
Condizione: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects. Codice articolo V12B-04487
Quantità: 1 disponibili
Da: moluna, Greven, Germania
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à: 1 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9780521424264
Quantità: 1 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Feb2416190002409
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 6020661-n
Quantità: 1 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
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à: 1 disponibili