A Characteristic Set Method for Solving Boolean Equations

More documents

Recommendations

Info

Background CS Method Implementation Experiment Conclusion Conclusion 1 We give the monic and disjoint monic zero decomposition theorems for polynomial equations over F2. 2 We may compute a Wu characteristic set of a Boolean polynomial system with a polynomial number of arithmetic operations.
Background CS Method Implementation Experiment Conclusion Conclusion 1 We give the monic and disjoint monic zero decomposition theorems for polynomial equations over F2. 2 We may compute a Wu characteristic set of a Boolean polynomial system with a polynomial number of arithmetic operations. 3 The method is comparable with F5 for moderately large size polynomial systems. 4 For very large systems, we still need improvements.
Page 1 and 2:
Background CS Method Implementation
Page 3 and 4:
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22: Background CS Method Implementation
Page 71: Background CS Method Implementation
Page 77: Background CS Method Implementation
show all

A Characteristic Set Method for Solving Boolean Equations

Create successful ePaper yourself

Delete template?

Save as template?