Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...
Abstract: As a part of the field of cryptography, rotation symmetric Boolean functions have rich cryptographic significance. In this paper, based on the knowledge of integer compositions, we present a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results