ISBN: 9780521424264 - computational complexity: a modern approach (12 Ergebnisse)

Hardcover. Zustand: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Zustand: Very Good.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New. pp. xxiv + 579 Illus.

Zustand: 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.

hardcover. Zustand: New.

Buch. Zustand: 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.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld Englisch.…

Buch. Zustand: 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.…

Buch. Zustand: Neu. Computational Complexity | A Modern Approach | Sanjeev Arora (u. a.) | Buch | Gebunden | Englisch | 2009 | Cambridge University Pr. | EAN 9780521424264 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.

Hardcover. Zustand: Brand New. 1st edition. 579 pages. 10.00x7.00x1.25 inches. In Stock.

Zustand: New. 2009. 1st Edition. Hardcover. New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students. Num Pages: 594 pages, 73 b/w illus. 6 tables 307 exercises. BIC Classification: GPJ; UYA. Category: (P) Professional & Vocational. Dimension: 260 x 184 x 37. Weight in Grams: 1232. A Modern Approach. 594 pages, 73 b/w illus. 6 tables 307 exercises. New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students. Cateogry: (P) Professional & Vocational. BIC Classification: GPJ; UYA. Dimension: 260 x 184 x 37. Weight: 1222. . . . . . Books ship from the US and Ireland. …

Buch. Zustand: 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. Englisch.…