Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Lecture Notes in Computer Science - Madhu Sudan - Libros - Springer-Verlag Berlin and Heidelberg Gm - 9783540606154 - 13 de diciembre de 1995
En caso de que portada y título no coincidan, el título será el correcto

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Lecture Notes in Computer Science

Precio
$ 55,99
sin IVA

Pedido desde almacén remoto

Entrega prevista 29 de jun. - 10 de jul.
Añadir a tu lista de deseos de iMusic

Building on results in theoretical computer science, this work offers theoretical insights and advances in applicable techniques in such areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algoritms, and NP-complete optimization.


94 pages, biography

Medios de comunicación Libros     Paperback Book   (Libro con tapa blanda y lomo encolado)
Publicado 13 de diciembre de 1995
ISBN13 9783540606154
Editores Springer-Verlag Berlin and Heidelberg Gm
Páginas 94
Dimensiones 156 × 234 × 5 mm   ·   163 g
Lengua Alemán  
Editor Sudan, Madhu

Mere med samme udgiver