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: Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback