Can I read Mathematics for Computer Science on EtoBox?

Mathematics for Computer Science by Eric Lehman, F Thomson Leighton, Albert R Meyer is a nonfiction available to read on EtoBox.

What is Mathematics for Computer Science about?

I Proofs 1 Propositions 1.1 Compound Propositions 1.2 Propositional Logic in Computer Programs 1.3 Predicates and Quantifiers 1.4 Validity 1.5 Satisfiability 2 Patterns of Proof 2.1 The Axiomatic Method 2.2 Proof by Cases 2.3 Proving an Implication 2.4 Proving an ``If and Only If'' 2.5 Proof by Contradiction 2.6 Proofs about Sets 2.7 Good Proofs in Practice 3 Induction 3.1 The Well Ordering Principle 3.2 Ordinary Induction 3.3 Invariants 3.4 Strong Induction 3.5 Structural Induction 4 Number Theory 4.1 Divisibility 4.2 The Greatest Common Divisor 4.3 The Fundamental Theorem of Arithmetic 4.4 Alan Turing 4.5 Modular Arithmetic 4.6 Arithmetic with a Prime Modulus 4.7 Arithmetic with an Arbitrary Modulus 4.8 The RSA Algorithm II Structures 5 Graph Theory 5.1 Definitions 5.2 Matching Problems 5.3 Coloring 5.4 Getting from A to B in a Graph 5.5 Connectivity 5.6 Around and Around We Go 5.7 Trees 5.8 Planar Graphs 6 Directed Graphs 6.1 Definitions 6.2 Tournament Graphs 6.3 Communication Networks 7 Relations and Partial Orders 7.1 Binary Relations 7.2 Relations and Cardinality 7.3 Relations on One Set 7.4 Equivalence Relations 7.5 Partial Orders 7.6 Posets and DAGs 7.7 Topological Sort 7.8

Who reads Mathematics for Computer Science?

Author

Eric Lehman, F Thomson Leighton, Albert R Meyer

Language

EN

Category

nonfiction