Boolean sum

Boolean sum
[1960-65; named after G. BOOLE; see -AN]

* * *


Universalium. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Boolean sum — Math. See symmetric difference. [1960 65; named after G. BOOLE; see AN] …   Useful english dictionary

  • Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… …   Wikipedia

  • sum — [sum; ] for n. 6 [ so͞om] n. [ME somme < MFr < L summa, fem. of summus, highest, superl. < base of super: see SUPER ] 1. an amount of money [a sum paid in reparation] 2. the whole amount; totality; aggregate [the sum of our experience] 3 …   English World dictionary

  • Boolean ring — In mathematics, a Boolean ring R is a ring (with identity) for which x 2 = x for all x in R ; that is, R consists only of idempotent elements.Boolean rings are automatically commutative and of characteristic 2 (see below for proof). A Boolean… …   Wikipedia

  • Boolean algebra — /booh lee euhn/ 1. Logic. a deductive logical system, usually applied to classes, in which, under the operations of intersection and symmetric difference, classes are treated as algebraic quantities. 2. Math. a ring with a multiplicative identity …   Universalium

  • Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… …   Wikipedia

  • Two-element Boolean algebra — In mathematics and abstract algebra, the two element Boolean algebra is the Boolean algebra whose underlying set (or universe or carrier ) B is the Boolean domain. The elements of the Boolean domain are 1 and 0 by convention, so that B ={0,1}.… …   Wikipedia

  • Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 …   Wikipedia

  • Karnaugh map — For former radio station KMAP (1962 1968) in Dallas Fort Worth, see KRLD FM. An example Karnaugh map The Karnaugh map (K map for short), Maurice Karnaugh s 1953 refinement of Edward Veitch s 1952 Veitch diagram, is a method to simplify Boolean… …   Wikipedia

  • Disjunct matrix — Disjunct and separable matrices play a pivotal role in the mathematical area of non adaptive group testing. This area investigates efficient designs and procedures to identify needles in haystacks by conducting the tests on groups of items… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”