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

Theory of Computational Complexity (Cód: 9312019)

Ko,Ker-I; 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

Total:

Em até 1x sem juros de


Crédito:
Boleto:
Cartão Saraiva:

Total:

Em até 5x sem juros de


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

Peso 0.00 Kg
Produto sob encomenda Não
Marca Wiley (Digital)
Idioma 337
Acabamento e-book
Início da Venda 10/03/2016
Cód. Barras 9781118594971
Número da edição 2
Ano da Publicação 114
AutorKo,Ker-I; Du,Ding-Zhu