The Clifford algebra of $R^{n,n}$ and the Boolean Satisfiability Problem [PDF]
Marko Budinich
openalex +1 more source
Solving Boolean satisfiability problems with resistive content addressable memories
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional digital architectures, particularly when stochastic decisions are involved.
Giacomo Pedretti +17 more
openaire +2 more sources
Efficient optimization with higher-order ising machines. [PDF]
Bybee C +5 more
europepmc +1 more source
SAT-GATv2: A Dynamic Attention-Based Graph Neural Network for Solving Boolean Satisfiability Problem [PDF]
Wenjing Chang, Wenlong Liu
openalex +1 more source
EVALUATION OF SERVICE-ORIENTED APPLICATION SCALABILITY FOR SOLVING BOOLEAN SATISFIABILITY PROBLEMS [PDF]
V.G. Bogdanova, S.A. Gorskiy
openalex +1 more source
Synthesising Programs with Non-trivial Constants. [PDF]
Abate A +8 more
europepmc +1 more source
Solving Boolean Satisfiability Problems Using A Hypergraph-based Probabilistic Computer [PDF]
Yihan He +9 more
openalex +1 more source
Estimating the Density of States of Boolean Satisfiability Problems on\n Classical and Quantum Computing Platforms [PDF]
Tuhin Sahai +3 more
openalex +1 more source
WGT: Tools and algorithms for recognizing, visualizing, and generating Wheeler graphs. [PDF]
Chao KH, Chen PW, Seshia SA, Langmead B.
europepmc +1 more source
Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem [PDF]
Alexander Semenov, Oleg Zaikin
openalex +1 more source

