Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

P, NP, and NP-Completeness

Name: P, NP, and NP-Completeness
Brand: Cambridge University Press
SKU: 02025345
Price: 155.07 EUR
Availability: InStock
Author: Oded Goldreich
ISBN: 9780521192484

The Basics of Computational Complexity

Oded Goldreich

Língua

Inglês

Livro Livro de capa dura

Código Libristo: 02025345

Editoras Cambridge University Press, agosto 2010

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provid... Descrição completa

Código Libristo: 02025345

375 b

155.07 €

Armazenamento externo Envio em 14-21 dias

Até 30 dias para devoluções

Os clientes também compraram

Berserk 17 Kentaro Miura

Capa mole

9.70 €

Neuropsychiatrie Jan Roth

Livro de capa dura

94.61 €

La casa de Bernarda Alba Federico García Lorca

Capa mole

8.68 €

Pán prsteňov 1 Spoločenstvo prsteňa John Ronald Reuel Tolkien

Capa mole

15.76 €

Best Of Al & Power Bano

CD de áudio

11.41 €

Zvýrazňovač Stabilo BOSS Pastel fialový

Artigos de papelaria

1.61 €

Żądło Paul Murray

Livro de capa dura

17.68 €

Die Lieblingsgedichte der Deutschen Wolfgang Nickel

Capa mole

10.91 €

Die Wichtelkinder - Memospiel mit 40 Karten - Anaconda Verlag

Jogo

6.76 €

Minecraft Where's the Zombie: Search and Find Mojang AB

Livro de capa dura

12.63 €

Especial DELE B2 Curso completo - libro del alumno Hortelano Elena González

Capa mole

27.29 €

Nachdenken uber Christa T. von Christa Wolf - Entstehung, strukturelle und sprachliche Besonderheiten Angelina Schulz

Capa mole

16.17 €

Ego gra

Jogo

21.73 €

Ona, oni a já aneb Vychovatelem snadno a rychle Miroslav Macek

Livro de capa dura

11.51 €

Emma und der Blaue Dschinn Cornelia Funke

Livro de capa dura

11.92 €

Das Opfer in der Bibel Friedrich Weinreb

Livro de capa dura

41.94 €

Hlboký čas: Príbeh našej Zeme Riley Black

Livro de capa dura

29.11 €

Emočne zrelá žena Peter Scazzero Geri

Capa mole

17.78 €

Fleurs

Capa mole

19.91 €

Internat Serhiy Zhadan

Capa mole

24.45 €

Anselm Kiefer. Ediz. italiana Janne Sirén

Livro de capa dura

41.74 €

Homo Romanus II ćwiczenia do języka łacińskiego i kultury antycznej praca zbiorowa Livro

Capa mole

11.01 €

Coloriages Mystères Disney Portraits Christophe-Alexis Perez

Capa mole

20.41 €

Spy x Family - tome 3 Tatsuya Endo

Capa mole

9.90 €

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.