Many years of practical experience in teaching discrete mathematics form the basis of this text book. Part I contains problems on such topics as Boolean algebra, k-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolean minimization and logical design. The exercises are preceded by ample theoretical background material. For further study the reader is referred to the extensive bibliography. Part II follows the same structure as Part I, and gives helpful hints and solutions. Audience:This book will be of great value to undergraduate students of discrete mathematics, whereas the more difficult exercises, which comprise about one-third of the material, will also appeal to postgraduates and researchers.in a class of contact circuits (notation Lk(f)) is the complexity of a minimal contact circuit realizing f. A complexity of a Boolean function f in the class of T-circuits is the number of contacts in the minimal T-circuit realizing f (notation Ln( f)).

Title | : | Problems and Exercises in Discrete Mathematics |

Author | : | G.P. Gavrilov, A.A. Sapozhenko |

Publisher | : | Springer Science & Business Media - 2013-03-09 |

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

`1.`Register a free 1 month Trial Account.`2.`Download as many books as you like (Personal use)`3.`Cancel the membership at any time if not satisfied.