Envío gratis a partir de 69,99 euros.

«Comprobar estado del pedido»

Entre a formar parte de una comunidad de amantes de los libros del mundo entero y acceda a un sinfín de ventajas. Crear una cuenta gratis

Envío gratuito con Zásilkovna para compras superiores a 59.99 €

Mensajería SEUR 4.99 € Mensajería GLS 7.99 € Mensajería Correos 5.49 € Mensajería DHL 5.49 € Punto SEUR 3.99 €

Contacto

Cómo comprar

Ayuda

Mi cuenta

▸ Vacío :-(

Envío gratis a partir de 69,99 euros.

Mathematics for Computer Science

Name: Mathematics for Computer Science
Brand: Samurai Media Limited
SKU: 16043461
Price: 62.89 EUR
Availability: InStock
Author: Lehman Eric
ISBN: 9789888407064

Lehman Eric

Leighton F Thomson

Meyer R Albert

Idioma

Inglés

Libro Tapa dura

Código Libristo: 16043461

Editores Samurai Media Limited, marzo 2017

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes... Descripción completa

Código Libristo: 16043461

154 b

62.89 €

Almacenamiento externo Envío en 14-21 días

Hasta 30 días para devoluciones

Clientes que también han comprado

Essential Math for AI Hala Nelson

Tapa blanda

62.89 €

AI and Machine Learning For Coders Laurence Moroney

Tapa blanda

52.09 €

Operating System Concepts Greg Gagne

Hoja

107.79 €

Types and Programming Languages Pierce

Tapa dura

111.49 €

Concrete Mathematics Ronald Graham

Tapa dura

85.59 €

Art of Computer Programming, The, Volumes 1-4B, Boxed Set Donald Knuth

Tapa dura

305.29 €

Learning SQL Alan Beaulieu

Adobe ePub DRM

53.49 €

Compilers: Principles, Techniques, and Tools A. V. Aho

Tapa blanda

121.89 €

Introduction to the Theory of Computation Michael Sipser

Tapa dura

392.09 €

High Performance Python Ian Oszvald

Tapa blanda

50.89 €

Hacker's Delight Henry Warren

Tapa dura

57.49 €

AI-Assisted Coding Bernd Öggl

Tapa blanda

39.69 €

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.