Mathematics for Computer Science

“mcs” — 2017/3/3 — 11:21 — page 977 — #985
977
INDEX
page rank, 917, 919
pair, 280
pairwise independence, 863
pairwise independent, 769, 864, 865
Pairwise Independent Additivity, 864
Pairwise Independent Sampling, 868,
896
partial correctness, 168
partial fractions, 683
partial order, 385, 415
strict, 386, 394
weak, 387, 394
particular solution, 948
partition, 383
Pascal’s Triangle Identity, 635
path, 835
perfect graph, 456
perfect number, 290, 330
permutation, 542, 604
Perturbation Method, 549
perturbation method, 676
pessimal spouse, 178
Pick-4, 874
planar drawing, 517
planar embedding, 523, 524, 540
planar graph, 521
planar graphs, 463
planar subgraph, 531
plug-and-chug, 933
pointwise, 98
Polyhedra, 533
polyhedron, 533
polynomial time, 60, 301, 453
population size, 869
power, 770
predicate, 8
pre-MST, 475
preserved invariant, see invariant, 161
preserved under isomorphism, 452
prime, 5, 28, 301
Prime Number Theorem, 302, 322
relatively prime, 318
Prime Factorization Theorem, see Unique
Factorization Theorem
probability density function, 803
probability density function,, 802
probability function, 734, 782
probability of an event, 734
probability space, 734
Product Rule, 753
product rule, 796
Product Rule (counting), 599
Product Rule (generating functions),
678
proof, 9, 17
proof by contradiction, 16
proposition, 4, 5
propositional variable, 46
public key cryptography, 326
Pulverizer, 297, 331, 332
pure first-order formula, 260
P vs. NP, 61
Pythagoreans, 533
quicksort, 809
quotient, 292
randomized algorithm, 809
random sample, 898
random sampling, 896
random variable, 799
random variables, 800
random walk, 835, 918
Random Walks, 905
range, 98
reachable, 163
reciprocal, 693
recognizes, 273
recurrence, 933