Frete Grátis
  • Google Plus

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!

R$ 467,30 em até 10x de R$ 46,73 sem juros
Cartão Saraiva R$ 443,94 (-5%) em até 1x no cartão ou em até 12x de R$ 38,94 sem juros
Grátis

Cartão Saraiva
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

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

Formas de envio Custo Entrega estimada
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

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

Avaliações

Avaliação geral: 0

Você está revisando: Wiley Series In Discrete Mathematics And Optimization - Theory Of Computational Complexity

Wiley Series In Discrete Mathematics And Optimization - Theory Of Computati... (Cód: 9396574) Wiley Series In Discrete Mathematics And Optimizat... (Cód: 9396574)
R$ 467,30
Wiley Series In Discrete Mathematics And Optimization - Theory Of Computati... (Cód: 9396574) Wiley Series In Discrete Mathematics And Optimizat... (Cód: 9396574)
R$ 467,30