A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “Boolean satisfiability” 5

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Zeroth and higher-order logic with content addressable memories
2023 Technical digest - International Electron Devices Meeting/Technical digest conference-paper Computer Science Network Packet Processing and Optimization

Giacomo Pedretti, Fabian Böhm, Mohammad Hizzani, Sergey Serebryakov, Dmitri B. Strukov, John Paul Strachan, +4 more

5

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
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
Deciding minimal distinguishing DFAs is NP-complete
2023 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Jan Martens

0

citations

5 results