Mathematics for Computer Science

(Frankie) #1

INDEX 679


axioms, 4 , 10


Banach-Tarski, 102
base case, 116
basis step, 116
Bayes’ Rule, 545
Benes nets, ̆ 287
Bernoulli distribution, 578
Bernoulli variable, 625
Bernoulli variables, 574
biased, 661
bijection, 498
Bijection Rule, 449
bijective, 76
binary predicate, 54
binary relation, 74
Binary relations, 73
binary trees, 176
binomial, 463
binomial coefficient, 464
binomial coefficients, 494
binomial distribution, 578 , 582 , 628
Binomial Theorem, 464
bin packing, 635
bipartite graph, 307 , 311, 347, 373
degree-constrained, 311
birthday principle, 557
blocks, 257
body, 391
bogus proofs, 21
Boole’s inequality, 534
Boolean variables, 36
Borel-Cantelli lemma, 658
bottleneck, 311
branches, 391
Brin, Sergey, 233
buildup error, 328
busy, 610
butterfly, 285
butterfly net, 297


Cancellation, 206
Cantor’s paradise, 91, 103
cardinality, 88
carry bit, 56
CDO, 657
chain, 253 , 269
chain of “iff”, 16
characters, 160
Chebyshev’s bound, 651
Chebyshev’s Theorem, 621 , 633
Chebyshev bound, 649
Chernoff Bound, 636
Chinese Appetizer problem, 619
Chinese Remainder Theorem, 222
Choice axiom, 101
chromatic number, 321
Church-Turing thesis, 198
closed forms, 401
closed walk, 237 , 324
CML, 296 , 297
CNF, 45
codomain, 71 , 74
Cohen, 102
collateralized debt obligation, 657
colorable, 320
coloring, 320
solid, 336
combinatorial proof, 399, 477 , 508
common divisor, 189
communication nets, 233
compilation, 95
complement, 68
Complement Rule, 534
complete binary tree, 279
complete bipartite graph, 361
complete digraph, 260
complete graph, 303 , 361
components, 70
composing, 73
Free download pdf