Ulteriori informazioni
No detailed description available for "Discrete Mathematics With Cryptographic Applications".
Sommario
1: Elementary Functions
2: Propositional Algebra
3: Naïve and Formal (Axiomatic) Set Theory
4: Mappings; Groups, Rings, and Fields; Matrices and Determinants
5: Predicates and Quantifiers
6: Binary Relations and Relational Databases
7: Combinatorics
8. Number Theory
9: Boolean Functions
10: Hashing Functions and Cryptographic Maps
11: Generating Polynomials and Inversion Formulas
12: Systems of Representatives
13: Boolean Algebras
14: Combinatorial Circuits
15: Complete Systems of Boolean Functions
16: Graph Theory
17: Trees and Digraphs
18: Computations and Algorithms
19: Finite Automata
20: Game Theory
21: Information Theory and Coding
22: Probability Theory with a Finite Sample Space
23: Turing Machines, P, NP Classes and Other Models
24: Answers and Solutions to Selected Exercises
Index
Info autore
Alexander I. Kheyfits, Ph.D. taught undergraduate and graduate-level subjects in mathematics and computer science for over thirty years at various CUNY colleges, including the CUNY Graduate Center and Bronx Community College. He has published several books, over forty journal articles, and has been an invited speaker at numerous conferences.
