Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...
Abstract: In 2007 Zhou et al. introduced a powerful software obfuscation technique using Mixed Boolean-Arithmetic (MBA) expressions and a special family of permutation polynomials on the modular ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback