Download Boolean Functions: Theory, Algorithms, and Applications by Yves Crama, Peter L. Hammer PDF

By Yves Crama, Peter L. Hammer

ISBN-10: 0521847516

ISBN-13: 9780521847513

Show description

Read or Download Boolean Functions: Theory, Algorithms, and Applications (Encyclopedia of Mathematics and its Applications 142) PDF

Best mathematics books

Mathematical Methods for Physicists (6th Edition)

This best-selling identify offers in a single convenient quantity the basic mathematical instruments and strategies used to resolve difficulties in physics. it's a important addition to the bookshelf of any severe scholar of physics or examine specialist within the box. The authors have placed massive attempt into revamping this re-creation.

Duality for Nonconvex Approximation and Optimization

During this monograph the writer offers the idea of duality for nonconvex approximation in normed linear areas and nonconvex worldwide optimization in in the neighborhood convex areas. exact proofs of effects are given, besides various illustrations. whereas a few of the effects were released in mathematical journals, this can be the 1st time those effects look in booklet shape.

Automatic Sequences (De Gruyter Expositions in Mathematics, 36)

Computerized sequences are sequences that are produced by way of a finite automaton. even though they aren't random, they might glance as being random. they're advanced, within the feel of no longer being finally periodic. they might additionally glance really complex, within the experience that it may possibly now not be effortless to call the rule of thumb during which the series is generated; even if, there exists a rule which generates the series.

AMERICAN WRITERS, Retrospective Supplement I

This selection of severe and biographical articles covers amazing authors from the seventeenth century to the current day.

Additional info for Boolean Functions: Theory, Algorithms, and Applications (Encyclopedia of Mathematics and its Applications 142)

Sample text

Xn ) or ψ(x1 , x2 , . . , xn ) to denote Boolean expressions in the variables x1 , x2 , . . , xn . 2. Here are some examples of Boolean expressions: φ1 (x) = x, φ2 (x) = x, ψ1 (x, y, z) = (((x ∨ y)(y ∨ z)) ∨ ((xy)z)), ψ2 (x1 , x2 , x3 , x4 ) = ((x1 x2 ) ∨ (x 3 x 4 )). Now, since disjunction, conjunction, and complementation can be interpreted as Boolean functions, every Boolean expression φ(x1 , x2 , . . , xn ) can also be viewed as generating a Boolean function defined by composition. 5. The Boolean function fφ represented (or expressed) by a Boolean expression φ(x1 , x2 , .

As a matter of fact, f has no prime implicants other than xy and xz. 7 Implicants and prime implicants 27 Prime implicants play a crucial role in constructing DNF expressions of Boolean functions. 4). 13. Every Boolean function can be represented by the disjunction of all its prime implicants. Proof. Let f be a Boolean function on B n , and let P1 , P2 , . . , Pm be its prime implicants (notice that m is finite because the number of elementary conjunctions on n variables is finite). Consider any DNF representation of f , say φ = rk=1 Ck .

Xn ) = f (x1 , . . , xk−1 , 1, xk+1 , . . 8 Restrictions of functions, essential variables 29 and similarly for f|xk =0 (x1 , x2 , . . , xn ). This slight abuse of definitions is innocuous and we use it whenever it proves convenient. Also, we use shorthand like f|x1 =0,x2 =1,x3 =0 instead of the more cumbersome notation f|x1 =0 |x =1 . 2 |x3 =0 The link between representations of a function and representations of its restrictions is straightforward. 15. Let f be a Boolean function on Bn , let ψ be a representation of f , and let k ∈ {1, 2, .

Download PDF sample

Rated 4.36 of 5 – based on 12 votes