From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “Boolean satisfiability” 10

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing
2026 Nature Communications article Engineering Advanced Memory and Neural Computing Open access

Haesol Im, Fabian Böhm, Giacomo Pedretti, Noriyuki Kushida, Moslem Noori, Xiangyi Zhang, +9 more

0

citations
Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing
2026 Nature Communications article Engineering Advanced Memory and Neural Computing Open access

Haesol Im, Fabian Böhm, Giacomo Pedretti, Noriyuki Kushida, Moslem Noori, Xiangyi Zhang, +10 more

0

citations
Applying aspiration in local search for satisfiability
2020 PLoS ONE article Computer Science Constraint Satisfaction and Optimization Open access

Peng Cong, XU Zhong-wei, Meng Mei

5

citations
The Compilability Thresholds of 2-CNF to OBDD
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Alexis de Colnet, Alfons Laarman, Joon Lee

0

citations
Differentiable Content Addressable Memory with Memristors
2022 Advanced Electronic Materials article Engineering Advanced Memory and Neural Computing Open access

Giacomo Pedretti, Catherine E. Graves, Thomas Van Vaerenbergh, Sergey Serebryakov, Martin Foltín, Xia Sheng, +3 more

27

citations
veriSIMPLER: An Automated Formal Verification Methodology for SIMPLER MAGIC Design Style Based In-Memory Computing
2024 IEEE Transactions on Circuits and Systems I Regular Papers article Engineering Advanced Memory and Neural Computing

Chandan Kumar Jha, Khushboo Qayyum, Kemal Çağlar Coşkun, Simranjeet Singh, Muhammad Hassan, Rainer Leupers, +2 more

7

citations
Computing high-degree polynomial gradients in memory
2024 Nature Communications article Engineering Advanced Memory and Neural Computing Open access cited by 1 patent

Tinish Bhattacharya, George Higgins Hutchinson, Giacomo Pedretti, Xia Sheng, Jim Ignowski, Thomas Van Vaerenbergh, +3 more

22

citations
Hybrid divide-and-conquer approach for tree search algorithms
2023 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Mathys Rennela, Sebastiaan Brand, Alfons Laarman, Vedran Dunjko

9

citations
Extensions of the Cylindrical Algebraic Covering Method for Quantifiers
2026 Mathematics in Computer Science article Computer Science Polynomial and algebraic computation Open access

Jasper Nalbach, Gereon Kremer

1

citations
Parameterized Complexity of Scheduling Unit-Time Jobs with Generalized Precedence Constraints
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Engineering Scheduling and Optimization Algorithms Open access

0

citations

10 results