43 citations
- QLT (Canada)CA5 papers
- Forschungszentrum JülichDE3 papers
- Santa Fe InstituteUS3 papers
- Texas A&M UniversityUS3 papers
- University of California, Santa BarbaraUS3 papers
- Hewlett Packard Enterprise (Ireland)IE2 papers
- Hewlett Packard Enterprise (United States)US2 papers
- RWTH Aachen UniversityDE2 papers
- Adam Mickiewicz University in PoznańPL1 paper
- Ames Research CenterUS1 paper
- Ben-Gurion University of the NegevIL1 paper
- Budapest University of Technology and EconomicsHU1 paper
Showing 2025 · cs.ETShow all
2 papers · 2 filters
cs.ET2025
Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing
Haesol Im, Fabian Böhm, Giacomo Pedretti +14
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…
cs.ET2025★ 16 cited
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…