Question

Asked 5th Aug, 2012

Indian Institute of Technology (ISM) Dhanbad

Boolean Function simplification

Boolean Function simplification required (to minimum no of literals)!

F=w'x(z'+yz)+y(ww+w'yz)..?

Mathematics

Robert Garian

Library of Congress

Joykrishan:

See: http://sce.umkc.edu/~hieberm/281_new/lectures/simplification/simplification.html

There are two serious limitations to using Boolean algebra

There is no algorithm you can follow that is guaranteed to lead to the simplest form of the expression

Given any intermediate result there is no way to tell if it is in fact the simplest form of the expression

That doesn't mean that you can't simplify expressions, only that you can't be

sure that you have always found the minimal expression. This is a subproblem of

term rewriting.

Also, see: http://www.wolfram.com/products/mathematica/newin7/content/IndustrialStrengthBooleanComputation/

for more information on minimization of formulas with up to thousands of variables.

Cite

Vipin Musale

Eritrea Institute of Technology

F=w'x(z'+yz)+y(ww+w'yz)

=w'xz'+w'yz+yww+yw'yz

=w'xz'+w'yz+yw+w'yyz

=w'xz'+w'yz+yw+w'yz

=w'xz'+w'yz+w'yz+yw

=w'xz'+(w'yz+w'yz)+yw

=w'xz'+w'yz+yw

=w'(xz'+yz)+yw

Cite

Len Leonid Mizrah

Authernative, Inc., USA

P.F. Zabrodskii

Saratov State Medical University

Irina Mikhailovna Pechonkina

University of Jordan

Ljubomir Jacić

Technical College Požarevac

Barry Turner

University of Lincoln

Do you know an example of a space U^\perp\perp that is not a subset of U with following conditions? Can it be from l^2?

Question

1 answer

Asked 24th Apr, 2014

Prasanth G. Narasimha-Shenoi

X is an Inner product space and U is a subset(space) of X. U^\perp is the space of all vertices orthogonal to all the elements of U. Give an example of a space U^\perp\perp is not a subset of U. Can it be from l^2?

How can I compute roughness of object and background in an image?

Question

8 answers

Asked 23rd Jun, 2014

Sheema Khattak

How can lower approximations and upper approximations be computed in an image ?

How do you decide whether there is a big step or small step in an Euclidean Addition Chain?

Question

5 answers

Asked 16th Jan, 2015

Anubhav Saxena

I am implementing Point Multiplication with a Euclidean Addition Chain. I got stuck on how it is decided whether to do a big step or a small step.

e.g let k=40 then a1=1,a2=2,a3=a2+a1=3,a4=a3+a1=4 it is a small step but why cant it be a big step?

Mathematical modelling for metallurgists?

Question

3 answers

Asked 28th Jan, 2016

Deleted profile

Mathematical tools are widely used in physical sciences and engineering, but metallurgy seems to be an area where relatively few scientists develop detailed mathematical models. Can anyone suggest good reference texts that deal with mathematical modelling of metallurgical problems?

Can one solve the following exercise on natural numbers with common digits?

Question

17 answers

Asked 22nd May, 2016

Deleted profile

Transform the arithmetic of this exercise into algebra.

A variation of the Cantor-Bendixson theorem?

Question

26 answers

Asked 15th Sep, 2016

Deleted profile

Every closed subset of [0, 1] has a unique representation as the union of three disjoint sets: one is open, another one is perfect & nowhere dense, and the last one is at most countable.

How to write the Product of two sums N and M as a sum of three triangular numbers; each sum is composed of three triangular numbers ?

Question

19 answers

Asked 13th Feb, 2017

Deleted profile

Every integer can be expressed as a sum of three triangular numbers.

Given two integers N=a+b+c and M=x+y+z , how to express the product N*M as a sum of three triangular numbers. Example:

11=0+1+10 and 13=0+3+10 ; the product 11*13=143=10+28+105

How to write the product N*M=F(a,b,c,x,y,z) +G(a,b,c,x,y,z) +H(a,b,c,x,y,z) as three triangular numbers?

How can I mathematically diffrenciate between two images?

Question

9 answers

Asked 25th Feb, 2017

Mohammad Reza Moghaddam

like jensen shanon divergence or Kullback−Leibler divergence, is there other method to differentiate between two images?

Solved exercises of the course on mathematics. Vol. 2: analysis

Article

The Complexity of Mathematics

Preprint

Full-text available

Mar 2020

Frank Vega

The strong Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two primes. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A principal complexity class is NSPACE(S(n)) for some S(n). We show if the weak Goldbach's conjectu...

Lessons from mathematics education research in P.N.G.

Chapter