Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...

In the age of social media, the way we build community differs from years past. While some may find solace in sliding into Instagram direct messages or liking a post, others have taken to the streets.

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 ...