64 pages matching obtain in this book
Results 1-3 of 64
What people are saying - Write a review
We haven't found any reviews in the usual places.
B Equations in the TwoElement Boolean Algebra
16 other sections not shown
absolutely maximal algorithm apply basic solution bipartite graph bivalent variables Boolean equations Boolean function Boolean matrix Boolean Methods Chapter characteristic function characteristic vector constraints Corollary corresponding D. R. Fulkerson defined Definition denote determine disjoint disjunctive form elementary paths elements equivalent Example families of solutions formulas Fortet given graph G graph in Fig Hamiltonian circuit Hamiltonian paths hence implies incidence matrix integer internally stable sets Lemma locally minimizing point Math maximal internally stable minimal externally stable minimum obtain P. L. Hammer parameters Partially Ordered Sets path of length problem procedure Proof pseudo-Boolean function pseudo-Boolean programming reduces relation Romanian Rudeanu satisfying solution of equation solutions of 14 strongly connected strongly connected component subset Switching Circuits system of Boolean Table Theorem Theory two-element Boolean algebra values vertex vertices Xi x2