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...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Goldreich, Oded |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Cambridge ; New York :
Cambridge University Press,
©2010.
|
Temas: | |
Acceso en línea: | Texto completo |
Ejemplares similares
-
Complex networks : an algorithmic perspective /
por: Erciyes, Kayhan
Publicado: (2014) -
The golden ticket : P, NP, and the search for the impossible /
por: Fortnow, Lance, 1963-
Publicado: (2013) -
The modified algorithm of Jacobi-Perron /
por: Bernstein, Leon
Publicado: (1966) -
Approximation by complex Bernstein and convolution type operators /
por: Gal, Sorin G., 1953-
Publicado: (2009) -
Algorithms and complexity /
por: Wilf, Herbert S., 1931-2012
Publicado: (2002)