Computational Complexity : A Modern Approach - Arora, Sanjeev

Computational Complexity : A Modern Approach

Sanjeev Arora

Yayınevi: Cambridge University Press

Yayın tarihi: 05/2009

ISBN: 9780521424264

Yazar : Boaz Barak

Ciltli | İngilizce | 594 Sayfa | 253 mm x 215 mm

Tür: Bilgisayar-Akademik

  • Temin Süresi 28 - 42 iş günü

  • ÜYE GİRİŞİ YAPIN

    temin süresi ve fiyatını size bildirelim

  • ÜYE GİRİŞİ YAPIN

    stoklarımıza girdiğinde bilgilendirelim

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.

İlgili Ürünler

Bu Türde Çok Satanlar

Kredi Kartına Taksit İmkanı
  • 3 Taksit

  • 3 Taksit

  • 3 Taksit

©1996-2019 Pandora Yayın ve Kitap Hizmetleri A.Ş.

Mersis No: 0721-0430-4310-0015

Tasarım : Logo Site Tasarımı