Accelerating hybrid XOR-CNF Boolean satisfiability problems natively with in-memory computing.

Im H, Böhm F, Pedretti G, Kushida N, Noori M, Valiante E, Zhang X, Yang CW, Bhattacharya T, Sheng X, Ignowski J, Heittmann A, Strachan JP, Mohseni M, Beausoleil R, Vaerenbergh TV, Rozada I

Open source

DOI
10.1038/s41467-026-69465-2
Published
2026 Feb 19
Container
Nature communications
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1038/s41467-026-69465-2,
  title = {Accelerating hybrid XOR-CNF Boolean satisfiability problems natively with in-memory computing.},
  author = {Im H and Böhm F and Pedretti G and Kushida N and Noori M and Valiante E and Zhang X and Yang CW and Bhattacharya T and Sheng X and Ignowski J and Heittmann A and Strachan JP and Mohseni M and Beausoleil R and Vaerenbergh TV and Rozada I},
  year = {2026},
  journal = {Nature communications},
  doi = {10.1038/s41467-026-69465-2},
  url = {https://doi.org/10.1038/s41467-026-69465-2}
}

RIS

TY  - JOUR
TI  - Accelerating hybrid XOR-CNF Boolean satisfiability problems natively with in-memory computing.
AU  - Im H
AU  - Böhm F
AU  - Pedretti G
AU  - Kushida N
AU  - Noori M
AU  - Valiante E
AU  - Zhang X
AU  - Yang CW
AU  - Bhattacharya T
AU  - Sheng X
AU  - Ignowski J
AU  - Heittmann A
AU  - Strachan JP
AU  - Mohseni M
AU  - Beausoleil R
AU  - Vaerenbergh TV
AU  - Rozada I
PY  - 2026
JO  - Nature communications
DO  - 10.1038/s41467-026-69465-2
UR  - https://doi.org/10.1038/s41467-026-69465-2
ER  - 

APA

H, I., F, B., G, P., N, K., M, N., E, V., X, Z., CW, Y., T, B., X, S., J, I., A, H., JP, S., M, M., R, B., TV, V., & I, R. (2026). Accelerating hybrid XOR-CNF Boolean satisfiability problems natively with in-memory computing.. Nature communications. https://doi.org/10.1038/s41467-026-69465-2

Source records