Mathematics for Computer Science

“mcs” — 2017/3/3 — 11:21 — page 973 — #981
973
INDEX
of functions, 99
of relations, 376
Comprehension Axiom, 261
concatenation, 205, 372
concatentation, 234
conditional expectation, 814
confidence, 897
confidence level, 870
congestion, see communication net
congruence, see also modular arithemtic,
310
conjunctive form, 55, 78
conjunctive normal form, 56, 59
connected, 376, 465, 468
k-edge, 468
k-vertex, 468
edge, 468
connected components, 466
continuous faces, 521
Continuum Hypothesis, 263
contrapositive, 13, 53
converse, 53
convex function, 878
Convolution, 679
convolution, 679
Convolution Counting Principle, 696
corollary, 9
countable, 249, 264, 267
countably infinite, 249
counter-model, 66
coupon collector problem, 826
cover, 456
covering edge, 411
critical path, 383, 407
cumulative distribution function, 803
cut edge, 468
cycle, see directed graph, simple graph,
460, 463
of length n, 451
cycle of a graph, 465
DAG, 287, see directed graph
de Bruijn, Nicolaas, 396
degree d linear recurrence, 690
degree-constrained, 457, 625, 657
DeMorgan’s Laws, see also equivalence
(logic), 57
De Morgan’s Laws for Quantifiers, 64
derived variables, 171
deterministic games, 241
deviation from the mean, 853
diagonal argument, 254
diameter, 505, 509
Die Hard, 292
Difference Rule, 735
digraph, see directed graph
Dilworth’s lemma, 384
directed graph, 367, 369
cycle, 371
degree, 369
directed acyclic graph, 377
shortest path, 375
walk
trail, 398
walk counting matrix, 374
walk relation, 376, 385
directed graphs, 287
discrete faces, 524
disjunctive form, 55, 78
disjunctive normal form, 55, 59
Distributive Law
sets, 95
divide-and-conquer, 951
divisibility, 289, 369, 388
Division Rule (counting), 605
Division Theorem, 291
DNF, see disjunctive form
domain, 97
domain of discourse, 64, 664