Kniha Computational Complexity Sanjeev Arora

Computational Complexity

Autor: Sanjeev Arora
Jazyk: Angličtina
Vazba: Pevná
Dostupnost: Skladem u dodavatele
Odesíláme za 3-6 dnů
1 672
Describes recent achievements and classical results of computational complexity theory, including in...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
2009
Stránek
594
EAN
9780521424264
ISBN
0521424267
Enbook ID
04091826
Hmotnost
1312
Rozměry
184 x 260 x 37

Kompletní popis

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.

Mohlo by vás zajímat

1 913

Complexity Science

Henrik Jeldtoft Jensen
1 317

Dune

Frank Herbert
501
758
935

DECIPHER

Mark Frary
381
1 689
1 402

Complexity Theory

Ingo Wegener
1 677
1 677

Code Book

Simon Singh
241
2 514
1 776

Graph Theory

Reinhard Diestel
1 413

Cryptography Algorithms

Massimo Bertaccini
1 067
1 632

Zákaznicí kteří koupili tuto knihu koupili také

1 735
1 566
317

Goedel's Proof

Ernest Nagel
294

Naive Set Theory

Paul R. Halmos
241

Book of Proof

Richard H. Hammack
738

How To

Randall Munroe
306