Recomienda este artículo a tus amigos:
Bounded Arithmetic, Propositional Logic and Complexity Theory - Encyclopedia of Mathematics and its Applications Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague)
Precio
Mex$ 3.384
sin IVA
Pedido desde almacén remoto
Entrega prevista 5 - 23 de nov.
Los regalos de Navidad se podrán canjear hasta el 31 de enero
Recibe notificaciones sobre nuevos lanzamientos de Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague)
Nuestros clientes opinan:
Añadir a tu lista de deseos de iMusic
Bounded Arithmetic, Propositional Logic and Complexity Theory - Encyclopedia of Mathematics and its Applications
Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague)
An up-to-date, unified treatment of research in this interdisciplinary subject, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and computational complexity theory and lists a number of intriguing open problems.
360 pages, references, index
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 24 de noviembre de 1995 |
| ISBN13 | 9780521452052 |
| Editores | Cambridge University Press |
| Páginas | 360 |
| Dimensiones | 236 × 159 × 31 mm · 672 g |
| Lengua | Inglés |
| Editor de series | Doran, B. |
| Editor de series | Flajolet, Philippe |
| Editor de series | Ismail, M. |
| Editor de series | Lam, T. Y. |
| Editor de series | Lutwak, E. |
| Editor de series | Rota, Gian-carlo |
| Editor de series | Wutwak, E. |
