From

Institution

Field

Type

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

Reset

Papers matching “satisfiability” 807

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

More is Less: Adding Polynomials for Faster Explanations in NLSAT
2025 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Valentin Promies, Jasper Nalbach, Erika Ábrahám

0

citations
Compactness in Semiring Semantics
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Algebra and Logic Open access

Sophie Brinke, Anuj Dawar, Erich Grädel, Lovro Mrkonjić, Matthias Naaf

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
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
Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes
2025 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Tom Peham, L. Schmid, Lucas Berent, Markus Michael Müller, Robert Wille

16

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
Challenges and Opportunities in Quantum Optimization
2023 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Amira Abbas, Andris Ambainis, Brandon Augustino, Andreas Bärtschi, Harry Buhrman, Carleton Coffrin, +40 more

8

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
Reasoning about Beliefs and Meta-Beliefs by Regression in an Expressive Probabilistic Action Logic
2021 conference-paper Computer Science Logic, Reasoning, and Knowledge Open access

Daxin Liu, Gerhard Lakemeyer

4

citations
A Divide-and-Conquer Approach to Variable Elimination in Linear Real Arithmetic
2024 Lecture notes in computer science conference-paper Computer Science Polynomial and algebraic computation Open access

Valentin Promies, Erika Ábrahám

3

citations
Memristor-based hardware and algorithms for higher-order Hopfield optimization solver outperforming quadratic Ising machines
2023 arXiv (Cornell University) preprint Engineering Advanced Memory and Neural Computing Open access

Mohammad Hizzani, Arne Heittmann, George A. Hutchinson, Dmitrii Dobrynin, Thomas Van Vaerenbergh, Tinish Bhattacharya, +3 more

1

citations
Implementing arithmetic over algebraic numbers A tutorial for Lazard's lifting scheme in CAD
2021 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Polynomial and algebraic computation

Gereon Kremer

1

citations
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
2023 arXiv (Cornell University) preprint Computer Science Polynomial and algebraic computation Open access

Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown

1

citations
D6.6 Divide and quantum open source software
2022 Zenodo (CERN European Organization for Nuclear Research) report Computer Science Quantum Computing Algorithms and Architecture Open access

Sebastiaan Brand, Alfons Laarman

1

citations
SMT: Something You Must Try
2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

Erika Ábrahám, József Kovács, Anne Remke

1

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
Computing High-Degree Polynomial Gradients in Memory
2024 arXiv (Cornell University) preprint Engineering Advanced Memory and Neural Computing Open access

George Hutchinson, Giacomo Pedretti, Xia Sheng, Jim Ignowski, Thomas Van Vaerenbergh, Raymond G. Beausoleil, +2 more

1

citations
Translating Multi-Agent Modal Logics of Knowledge and Belief into Decidable First-Order Fragments
2025 Adaptive Agents and Multi-Agents Systems conference-paper Computer Science Logic, Reasoning, and Knowledge Open access

Qihui Feng, Hannah M. Wilk, Shakil M. Khan, Gerhard Lakemeyer

0

citations
Unifying Hidden-Variable Problems from Quantum Mechanics by Logics of Dependence and Independence
2021 arXiv (Cornell University) preprint Physics and Astronomy Quantum Mechanics and Applications Open access

Rafael Albert, Erich Grädel

0

citations
Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Tom Peham, L. Schmid, Lucas Berent, Markus Müller, Robert Wille

0

citations
Hybrid divide-and-conquer approach for tree search algorithms
2021 Zenodo (CERN European Organization for Nuclear Research) report Computer Science Quantum Computing Algorithms and Architecture Open access

Mathys Rennela, Sebastiaan Brand, Alfons Laarman, Vedran Dunjko

0

citations
Learning from Algorithm Feedback: One-Shot SAT Solver Guidance with GNNs
2025 arXiv (Cornell University) preprint Computer Science Constraint Satisfaction and Optimization Open access

Jan Tönshoff, Martin Grohe

0

citations
Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence
2022 Annals of Pure and Applied Logic article Physics and Astronomy Quantum Mechanics and Applications Open access

Rafael Albert, Erich Grädel

9

citations
Automated Reasoning in Quantum Circuit Compilation
2024 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

Dimitrios Thanos, Alejandro Villoria, Sebastiaan Brand, Arend-Jan Quist, Jingyi Mei, Tim Coopmans, +1 more

4

citations
Merging Adjacent Cells During Single Cell Construction
2024 Lecture notes in computer science conference-paper Computer Science Polynomial and algebraic computation

Jasper Nalbach, Erika Ábrahám

2

citations