Problems and Exercises in Discrete Mathematics

1. Auflage. Softcover version of original hardcover Auflage 1996
ISBN: 978-90-481-4702-1
Verlag: Springer

Buch, Englisch, Band 14, 424 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 663 g

Reihe: Texts in the Mathematical Sciences

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, -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.
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.

Zielgruppe

Research

Autoren/Hrsg.

Gavrilov, G.P.

Sapozhenko, A.A.

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik

Inhaltsverzeichnis

I Problems.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.- II Answers, Hints, Solutions.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.