Artboard 33 Artboard 16 Artboard 18 Artboard 15 Artboard 21 Artboard 1 Artboard 2 Artboard 5 Artboard 45 Artboard 45 Artboard 22 Artboard 9 Artboard 23 Artboard 17? Artboard 28 Artboard 43 Artboard 49 Artboard 47 Artboard 38 Artboard 32 Artboard 8 Artboard 22 Artboard 5 Artboard 25 Artboard 1 Artboard 42 Artboard 11 Artboard 41 Artboard 13 Artboard 23 Artboard 10 Artboard 4 Artboard 9 Artboard 20 Artboard 6 Artboard 11 Artboard 7 Artboard 3 Artboard 3 Artboard 12 Artboard 25 Artboard 34 Artboard 39 Artboard 24 Artboard 13 Artboard 19 Artboard 7 Artboard 24 Artboard 31 Artboard 4 Artboard 14 Artboard 27 Artboard 30 Artboard 36 Artboard 44 Artboard 12 Artboard 17 Artboard 17 Artboard 6 Artboard 27 Artboard 19 Artboard 30 Artboard 29 Artboard 29 Artboard 26 Artboard 18 Artboard 2 Artboard 20 Artboard 35 Artboard 15 Artboard 14 Artboard 48 Artboard 50 Artboard 26 Artboard 16 Artboard 40 Artboard 21 Artboard 29 Artboard 10 Artboard 37 Artboard 3 Artboard 3 Artboard 46 Artboard 8
Promoção Visa Checkout
e-book

Theory of Computational Complexity (Cód: 9312014)

Du, Ding-Zhu

Wiley (Digital)

Ooops! Este produto não está mais a venda.
Mas não se preocupe, temos uma versão atualizada para você.

Ooopss! Este produto está fora de linha, mas temos outras opções para você.
Veja nossas sugestões abaixo!

R$ 176,79 em até 5x de R$ 35,36 sem juros
Cartão Saraiva R$ 176,79 ou em até 8x de R$ 22,10 sem juros

Crédito:
Boleto:
Cartão Saraiva:

Total: R$0,00

Em até 5x sem juros de R$ 0,00


Theory of Computational Complexity

R$176,79

Descrição

Praise for the First Edition '...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity.' -Zentralblatt MATH
A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science Additional exercises at varying levels of difficulty to further test comprehension of the presented material End-of-chapter literature reviews that summarize each topic and offer additional sources for further study  Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research. A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent dev

Características

Produto sob encomenda Sim
Marca Wiley (Digital)
Cód. Barras 9781118593035
Acabamento ebook
Início da Venda 10/03/2016
Coleção / Série Wiley Series in Discrete Mathematics and Optimization
Territorialidade Internacional
Formato Livro Digital Pdf
Proteção Drm Sim
Número da edição 2
Idioma 337
Ano da Publicação 114
Peso 0.00 Kg
AutorDu, Ding-Zhu