The Art of Computer Programming: Introduction to Combinatorial Algorithms and Boolean Functions. Fascicle 0, Volume 4 |
Common terms and phrases
adjacency adjacency matrices Algorithm H binary bipartite graph Boolean chain Boolean function c₁ called classes color columns combinatorial algorithms complement compute conjunctive normal form construct contains corresponding cost cycle d₁ defined denote depth digraph disjunctive disjunctive normal form edges equivalent evaluate exactly example exercise formula function ƒ Furthermore G and H gates graph G hence Horn clauses Horn functions hypergraph induced subgraph integer latin squares length Math matrix maximal median graph minimum minterms monotone neighbors normal form notation operations optimum orthogonal otherwise output permutation Petersen graph points prime implicants problem Programming Prove rows satisfy Section self-dual sequence Show solution steps string strong component subcubes subgraph Suppose symmetric functions Theorem there's threshold function true truth table u₁ variables vectors vertex vertices y₁ zero