oprava existující anotace, přidání nové anotace
Název:
Autor:
Rok vydání:
2000
Identifikátory:
9780130890085
This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics.
© 2013-2024 Obálkyknih.cz - Jihočeská vědecká knihovna v Českých Budějovicích, admin@obalkyknih.cz