Introductory Discrete Mathematics (Dover Books on Computer Science) by V.K. Balakrishnan

by V.K. Balakrishnan

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. It emphasizes combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Numerous exercises help students test their grasp of the material. 65 illustrations.

Genres: Mathematics, Computer Science, Science

Unknown Binding

First published January 1, 1991

Reviews

[AH · Rating 4 out of 5]

I took a few private classes with a PHD student of mathematics as I wanted a compact course in discrete mathematics to boost my long neglected mathematical literacy and this book was his suggestion. Translated to Persian nicely but still not my cup of tea. I managed to stick with the book and the result was exactly as I expected. I'm in possession of an introductory knowledge of discrete mathematics that can hopefully be utilized in furthering my understanding in the coming years.

[JV · Rating 5 out of 5]

Me abriu o olho para muita coisa, em várias lições fiz reflexões filosóficas sobre o que estava lendo. O problema é que o autor, na primeira metade do livro, não dispensa muitas palavras - talvez supunha o leitor mais preparado. Por isso cacei no YouTube outras lições como suplemento. Sofri.

[Andrew Breza · Rating 4 out of 5]

Like most Dover Publications math textbooks, Introductory Discrete Mathematics delivers rigorous coverage of its topic at an affordable price. At times, the explanations are needlessly complex, so don't be afraid to Google things if you get stuck. Discrete math is a vitally important topic for computer science, but it has been unfairly neglected in many data science programs despite its versatility.

[Chloe Stafford · Rating 5 out of 5]

I think this book is very good. It should be noted that it's explainations can sometimes be worry and I am reading this after taking a discrete mathematics course (namely for graph theory and computer science topics since mine gave little attention to them)

I found the explanations there useful for understanding the P v NP distinctions and graph theorym

[Augusto de Lima · Rating 4 out of 5]

Como o nome diz, é um livro introdutório; Em muitos tópicos o autor faz apenas uma digressão, o maior foco fica na parte de contagem e grafos. É um livro interessante para consultas rápidas e também para exercícios.

[Adam Bournes · Rating 4 out of 5]

Solid intro to graph theory, combinatorics, and probability.