Tels.: DF (55) 55 54 94 02 • Cuernavaca (777) 102 83 86
portada Descargar ficha PDF Título: P, Np, And Np-Completeness. The Basics Of Computational Complexity
Autor: Goldreich, Oded Precio: $475.00
Editorial: Cambridge University Press Año: 2010
Tema: Computacion Edición: 1ª
Sinopsis ISBN: 9780521122542
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.
Disponibilidad: Bajo pedido    Contáctanos  ó Solicítalo
Librería Bonilla SA de CV © Todos los derechos reservados. 2019
Última actualización: Jul 2019