DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
By believing passionately in something that does not yet exist, we create it.
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. [Montgomery, IL, U.S.A.] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover 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. [Greven, Germany] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover Buy with confidence! Book is in acceptable condition with wear to the pages, binding, and some marks within 2.65 [Amherst, NY, U.S.A.] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover Good condition. This is the average used book, that has all pages or leaves present, but may include writing. Book may be ex-library with stamps and stickers. 2.65 [Tucson, AZ, U.S.A.] [Publication Year: 2009]
New York Cambridge University Press 2009 Hard cover New. Sewn binding. Cloth over boards. 594 p. Contains: Unspecified, Tables, black & white, Halftones, Tables, Line drawings, Figures.
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover 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. [Greven, Germany] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. 2.65 [Hawthorne, CA, U.S.A.] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover Very Good condition. Shows only minor signs of wear, and very minimal markings inside (if any). 2.65 [Tucson, AZ, U.S.A.] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover New Book. Shipped from UK. Established seller since 2000. [Fairford, GLOS, United Kingdom] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover New. Fast Shipping and good customer service [Fayetteville, TX, U.S.A.] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover Book is in NEW condition. Satisfaction Guaranteed! Fast Customer Service!! [Suffolk, United Kingdom] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Pr. Mai 2009] Hardcover 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. [Zwiesel, Germany] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Pr. Mai 2009] Softcover 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 [Bergisch Gladbach, Germany] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Pr. Mai 2009] Hardcover 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 [Bergisch Gladbach, Germany] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Pr. Mai 2009] Hardcover 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. [Einbeck, Germany] [Publication Year: 2009]
New York Cambridge University Press 2009 Hard cover New. Sewn binding. Cloth over boards. 594 p. Contains: Unspecified, Tables, black & white, Halftones, Tables, Line drawings, Figures.
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover New Book. Shipped from UK. Established seller since 2000. [Wood Dale, IL, U.S.A.] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover Buy with confidence! Book is in new, never-used condition 2.65 [Amherst, NY, U.S.A.] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover New! This book is in the same immaculate condition as when it was published 2.65 [Tucson, AZ, U.S.A.] [Publication Year: 2009]
New York Cambridge University Press 2009 Hard cover New. Sewn binding. Cloth over boards. 604 p. Contains: Unspecified, Tables, black & white, Halftones, Tables, Line drawings, Figures.
Hardback. 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 than 300 exercises are included. ISBN 0521424267 9780521424264 [GB]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Pr. Mai 2009] Hardcover 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. [Einbeck, Germany] [Publication Year: 2009]
ISBN10: 0521424267, ISBN13: 9780521424264, [publisher: Cambridge University Press] Hardcover First Edition Special order direct from the distributor [Victoria, BC, Canada] [Publication Year: 2009]
New York Cambridge University Press 2009 Hard cover New. Sewn binding. Cloth over boards. 594 p. Contains: Unspecified, Tables, black & white, Halftones, Tables, Line drawings, Figures.
Cambridge University Press, Date: 2009-04-20. Hardcover. Good. Textbook, May Have Highlights, Notes and/or Underlining, BOOK ONLYNO ACCESS CODE, NO CD, Ships with Emailed Tracking 2009. Cambridge University Press ISBN 0521424267 9780521424264 [US]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
