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

Wiley Series In Discrete Mathematics And Optimization - Theory Of Computational Complexity (Cód: 9396574)

Du, Ding-Zhu; Ko, Ker-I

John Wiley & Sons

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!

Economize até R$ 70,10

R$ 397,21 (-15%) em até 1x no crédito
R$ 467,30 em até 10x de R$ 46,73 sem juros
Cartão Saraiva R$ 397,21 (-15%) em até 1x no cartão ou em até 15x de R$ 31,15 sem juros

Crédito:
Boleto:
Cartão Saraiva:

Total: R$0,00

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


Wiley Series In Discrete Mathematics And Optimization - Theory Of Computational Complexity

R$467,30

Quer comprar em uma loja física? Veja a disponibilidade deste produto

Entregas internacionais: Consulte prazos e valores de entrega para regiões fora do Brasil na página do Carrinho.

ou receba na loja com frete grátis

X
Formas de envio Custo Entrega estimada

* Válido para compras efetuadas em dias úteis até às 15:00, horário de Brasília, com cartão de crédito e aprovadas na primeira tentativa.

X Consulte as lojas participantes

Saraiva MegaStore Shopping Eldorado Av. Rebouças, 3970 - 1º piso - Pinheiros CEP: 05402-600 - São Paulo - SP

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

Características

Peso 0.84 Kg
Produto sob encomenda Sim
Marca John Wiley & Sons
I.S.B.N. 9781118306086
Referência 024806304
Altura 23.62 cm
Largura 15.75 cm
Profundidade 3.05 cm
Idioma Inglês
Acabamento Capa dura
Cód. Barras 9781118306086
Número da edição 2
Ano da edição 2014
AutorDu, Ding-Zhu; Ko, Ker-I