Basic Counting and ListingSection 1: Lists with RepetitionsSection 2: Lists Without RepetitionSection 3: SetsSection 4: Probability and Basic CountingFunctionsSection 1: Some Basic TerminologySection 2: PermutationsSection 3: Other Combinatorial Aspects of FunctionsSection 4: Functions and ProbabilityDecision Trees and RecursionSection 1: Basic Concepts of Decision TreesSection 2: Recursive AlgorithmsSection 3: Decision Trees and Conditional ProbabilitySection 4: Inductive Proofs and Recursive EquationsBasic Concepts in Graph TheorySection 1: What is a Graph?Section 2: Digraphs, Paths, and SubgraphsSection 3: TreesSection 4: Rates of Growth ...
Mathematics for algorithm and systems analysis
Według internetowych rankingów, cena tego produkut waha się w okolicach 64 zł. Jak Ty oceniasz ?
- ISBN - 9780486442501
- Oprawa - miękka
- Ilość stron - 256
Najlepsza cena - najtańsza oferta
Basic Counting and ListingSection 1: Lists with RepetitionsSection 2: Lists Without RepetitionSection 3: SetsSection 4: Probability and Basic CountingFunctionsSection 1: Some Basic TerminologySection 2: PermutationsSection 3: Other Combinatorial Aspects of FunctionsSection 4: Functions and ProbabilityDecision Trees and RecursionSection 1: Basic Concepts of Decision TreesSection 2: Recursive AlgorithmsSection 3: Decision Trees and Conditional ProbabilitySection 4: Inductive Proofs and Recursive EquationsBasic Concepts in Graph TheorySection 1: What is a Graph?Section 2: Digraphs, Paths, and SubgraphsSection 3: TreesSection 4: Rates of Growth and Analysis of AlgorithmsSolutions to ExercisesNotation IndexSubject Index
- ISBN - 9780486442501
- Oprawa - miękka
- Ilość stron - 256
- Rok wydania - 2011
