Lists, Decisions and GraphsS. Gill Williamson |
Expressions et termes fréquents
algorithm allowed answer appears balls block called cards choices choose coin components compute conditional connected consider construct contains corresponds count cycle decision tree defined definition describe directed distinct distribution domain edges elements equal equivalence event exactly example exercise expected formula four function given gives graph height independent induction integers labels leaf least leaves length letters look loops means move multisets names notation Note obtain occurs pair partition path permutation picture positions possible probability problem proof prove random variable rank recursion relation repeated replacement represent result root Rule sample space selected sequence simple graph solution spanning tree specified starting Step student subsets Suppose Theorem toss values vertex vertices washer write