From

Institution

Field

Type

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

Reset

Papers matching “Boolean satisfiability” 12

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

The Compilability Thresholds of 2-CNF to OBDD
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Alexis de Colnet, Alfons Laarman, Joon Hyung Lee

0

citations
The Compilability Thresholds of 2-CNF to OBDD
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Alexis de Colnet, Alfons Laarman, J. Lee

0

citations
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
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
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
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
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
Thermodynamic Perspectives on Computational Complexity
2024 SSRN Electronic Journal preprint Computer Science Complexity and Algorithms in Graphs Open access

Florian Neukart

1

citations
Parameterized Complexity of Scheduling Unit-TimeJobs with Generalized Precedence Constraints
2025 arXiv (Cornell University) preprint Engineering Scheduling and Optimization Algorithms Open access

Christina Büsing, Maurice Draeger, Corinna Mathwieser

0

citations
Quantitative Monitoring of Signal First-Order Logic
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Marek Chalupa, Thomas A. Henzinger, N. Ege Saraç, Emily Yu

0

citations
Quantitative Monitoring of Signal First-Order Logic
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Marek Chalupa, Thomas A. Henzinger, N. Ege Saraç, Emily Yu

0

citations
Deciding minimal distinguishing DFAs is NP-complete
2023 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Jan Martens

0

citations

12 results