As it can be observed from the definition, application of distributive law to an arithmetic expression reduces the number of operations in it.
12.
The maximum likelihood decoding algorithm is an instance of the " marginalize a product function " problem which is solved by applying the generalized distributive law.
13.
This shows by an example that applying distributive law reduces the computational complexity which is one of the good features of a " fast algorithm ".
14.
It can hence be shown ( by proving the distributive laws ) that the power set considered together with both of these operations forms a Boolean ring.
15.
But if the two functions are applied to the same Church numerals they produce the same result, by the distributive law; thus they are extensionally equal.
16.
Where the first step uses the distributive law for the exterior product, and the last uses the fact that the exterior product is alternating, and in particular.
17.
Similarly, it is possible to define a " left near-ring " by replacing the right distributive law A3 by the corresponding left distributive law.
18.
Similarly, it is possible to define a " left near-ring " by replacing the right distributive law A3 by the corresponding left distributive law.
19.
A quasifield satisfying both distributive laws is called a "'semifield "', in the sense in which the term is used in projective geometry.
20.
The expression when expressed using the distributive law can be written as a ( b + c ) a simple optimization that reduces the number of operations to one addition and one multiplication.
