Problem Book in Discrete Mathematics

[631/100%]

M. I. Dekhtyar, S. M. Dudakov, M. I. Karlov, B. N. Karlov

Chapter 1Sets, Relations, and Functions[40/100%]

Chapter 2The Method of Mathematical Induction[21/100%]

Chapter 3Elements of Combinatorics[43/100%]

Chapter 4Propositional Logic and Boolean Functions[36/100%]

Chapter 5Equivalence of Formulas[16/94%]

Chapter 6Disjunctive and Conjunctive Normal Forms[19/100%]

Chapter 7Zhegalkin Polynomials[17/100%]

Chapter 8Complete Sets of Functions and Post's Theorem[42/100%]

Chapter 9Horn Formulas and the Production Retrieval Problem[14/100%]

Chapter 10Predicate Logic[25/100%]

Chapter 11Predicate Logic and Databases[7/100%]

Chapter 12Directed Graphs[24/100%]

Chapter 13Undirected Graphs[30/100%]

Chapter 14Trees[27/100%]

Chapter 15Algorithms on Graphs[24/100%]

Chapter 16Circuits of Functional Elements[25/100%]

Chapter 17Ordered Binary Decision Diagrams[20/100%]

Chapter 18Finite Automata: Transducers and Recognizers[25/100%]

Chapter 19Regular Languages and Finite Automata[23/100%]

Chapter 20Codings[32/100%]

Chapter 21Closure. Non-Automatic Languages[27/100%]

Chapter 22Program Computability[20/100%]

Chapter 23Partial Recursive Functions[26/100%]

Chapter 24Turing Machines[25/100%]

Chapter 25The Turing-Church Thesis and Undecidable Problems[23/100%]