Boolean Equation simlification

  • Thread starter Thread starter stosw
  • Start date Start date
stosw
Messages
19
Reaction score
0

Homework Statement



I'm trying to simplify the following to only use XOR and OR gates.

[EQ]x = ab'c'd' + a'd + a'c + a'b[/EQ]

The Attempt at a Solution



My only thought would be to

[EQ]x = ab'c'd' + a'd + a'c + a'b[/EQ]
[EQ]x = ab'c'd' + a'(d + c + b)[/EQ]

But I have no idea what else to do. Can anyone suggest something for me to check into or any tips/hints?
 
Physics news on Phys.org
Use DeMorgan's Laws on (b+c+d).
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Back
Top