Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: McCord Books, NORWALK, IA, U.S.A.
hardcover. Condizione: Good. Light cover and edge wear, few markings on text.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
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!
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Textbooks_Source, Columbia, MO, U.S.A.
Prima edizione
Hardcover. Condizione: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 73,10
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: California Books, Miami, FL, U.S.A.
EUR 82,23
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 64,61
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: eCampus, Lexington, KY, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 71,38
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 78,90
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Cambridge University Press, GB, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
EUR 96,93
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. 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.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 83,87
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press, GB, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 111,26
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. 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.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: moluna, Greven, Germania
EUR 67,59
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: 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.
EUR 115,44
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 1st edition. 579 pages. 10.00x7.00x1.25 inches. In Stock.
Lingua: Inglese
Editore: Cambridge University Press, GB, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
EUR 98,91
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. 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.
Lingua: Inglese
Editore: Cambridge University Pr. Mai 2009, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 84,13
Quantità: 2 disponibili
Aggiungi al carrelloBuch. 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.
Lingua: Inglese
Editore: Cambridge University Press, GB, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Rarewaves.com UK, London, Regno Unito
EUR 104,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. 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.
Lingua: Inglese
Editore: Cambridge University Press, 2009
ISBN 10: 0521424267 ISBN 13: 9780521424264
Da: Majestic Books, Hounslow, Regno Unito
EUR 85,54
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. xxiv + 579 Illus.
Da: Revaluation Books, Exeter, Regno Unito
EUR 87,17
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 1st edition. 579 pages. 10.00x7.00x1.25 inches. In Stock. This item is printed on demand.