Carregando...
P, NP, and NP-completeness : the basics of computational complexity /
"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 sol...
| Autor principal: | Goldreich, Oded |
|---|---|
| Formato: | Printed Book |
| Idioma: | English |
| Publicado em: |
New York :
Cambridge University Press,
2010.
|
| Assuntos: | |
| Acesso em linha: | Cover image |
Registros relacionados
-
P, NP and NP Completeness the basics of computational complexity
por: Goldreich, Oded
Publicado em: (2010) -
P, NP, and NP-completeness :The basics of computational complexity
por: Goldreich, Oded
Publicado em: (2010) -
P, NP and NP - completeness - the basics of computational complexity/
por: Goldreich, Oded
Publicado em: (2010) -
N.P.
por: Yoshimoto,Banana
Publicado em: (1990) -
Computational complexity : a modern approach /
por: Arora, Sanjeev
Publicado em: (2009)