Nature

Efficient solution of Boolean satisfiability problems with digital memcomputing

The Boolean satisfiability problem 1 (SAT) is an important decision problem solved by determining if a solution exists to a Boolean formula. A SAT instance is satisfiable when there exists an ...
Nature

Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing

The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and ...
IEEE

Tackling Satisfiability: SAT Instances Classification Using Several Machine Learning Approaches

Abstract: The Boolean Satisfiability Problem (SAT) is a computationally challenging and fundamental problem in computer science, with extensive applications in cryptography, artificial intelligence, ...
IEEE

Secure Outsourcing Scheme for Boolean Formulas Truth Assignment Problem

Abstract: The Boolean formula satisfiability problem (SAT) plays a fundamental role in many practical applications, but is computationally challenging due to its NP-hard nature. Leveraging cloud ...
GitHub

on_the_expressive_power_of_gnns_for_boolean_satisfiability.md

description [ICLR 2026][Graph Learning][GNN expressiveness] This paper rigorously proves, from the perspective of the Weisfeiler-Leman (WL) test, that the complete WL hierarchy cannot distinguish ...