Problems and Exercises in Discrete Mathematics

✍ Scribed by G. P. Gavrilov, A. A. Sapozhenko (auth.)

• Publisher: Springer Netherlands
• Year: 1996
• Tongue: English
• Leaves: 429
• Series: Kluwer Texts in the Mathematical Sciences 14
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages i-xi
Front Matter....Pages 1-1
Representations of Boolean Functions....Pages 3-37
Closed Classes and Completeness in Boolean Algebra....Pages 38-65
Many-Valued Logics....Pages 66-80
Graphs and Networks....Pages 81-109
Elements of Coding Theory....Pages 110-133
Finite Automata....Pages 134-187
Elements of Algorithm Theory....Pages 188-213
Combinatorics....Pages 214-253
Boolean minimization....Pages 254-272
Logical Design....Pages 273-293
Front Matter....Pages 295-295
Representations of Boolean Functions....Pages 297-302
Closed Classes and Completeness in Boolean Algebra....Pages 303-312
Many-Valued Logics....Pages 313-324
Graphs and Networks....Pages 325-328
Elements of Coding Theory....Pages 329-338
Finite Automata....Pages 339-347
Elements of Algorithm Theory....Pages 348-352
Combinatorics....Pages 353-402
Boolean Minimization....Pages 403-408
Logical Design....Pages 409-414
Back Matter....Pages 415-423

✦ Subjects

Mathematical Logic and Foundations; Discrete Mathematics in Computer Science; Theory of Computation; Combinatorics