A Characteristic Set Method for Solving Boolean Equations

More documents

Recommendations

Info

Background CS Method Implementation Experiment Conclusion Boolean Ring: Notations F2 = Z/(2) = {0, 1}. X = {x1, . . . , xn} a set of indeterminants H = {x 2 1 + x1, . . . , x 2 n + xn} A Boolean Ring: R2 = R2,n = F2[X]/(H)
Background CS Method Implementation Experiment Conclusion Boolean Ring: Notations F2 = Z/(2) = {0, 1}. X = {x1, . . . , xn} a set of indeterminants H = {x 2 1 + x1, . . . , x 2 n + xn} A Boolean Ring: R2 = R2,n = F2[X]/(H) Connection between Boolean Ring and Boolean Algebra: Boolean Algebra ⇒ Boolean Ring: f ∧ g ⇒ f · g f ∨ g ⇒ f · g + f + g Boolean Ring ⇒ Boolean Algebra: f · g ⇒ f ∧ g f + g ⇒ ¯ f ∧ g ∨ f ∧ ¯g
Page 1 and 2: Background CS Method Implementation
Page 9: Background CS Method Implementation
Page 61 and 62:
Background CS Method Implementation
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77:
show all

A Characteristic Set Method for Solving Boolean Equations

Create successful ePaper yourself

Delete template?

Save as template?