Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better
Sign Up to like & getrecommendations! Published in 2024 at "Entropy"
DOI: 10.1109/allerton63246.2024.10735285
Abstract: This paper examines the effectiveness of modern universal gate quantum computers in solving the Boolean Satisfiability (B-SAT) problem using Grover's Search algorithm. Experiments were conducted with varying configurations, including the number of shots, qubit mapping,… read more here.
Keywords: problem using; solving sat; sat problem; using quantum ... See more keywords
Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework
Sign Up to like & getrecommendations! Published in 2024 at "PeerJ Computer Science"
DOI: 10.7717/peerj-cs.2169
Abstract: The Boolean satisfiability (SAT) problem exhibits different structural features in various domains. Neural network models can be used as more generalized algorithms that can be learned to solve specific problems based on different domain data… read more here.
Keywords: gated recurrent; predicting satisfiability; problem; gru transformer ... See more keywords