Not finding it? Sign in to also search OpenAlex live.
-
Quantum annealing for hard 2-satisfiability problems: Distribution and scaling of minimum energy gap and success probability2022 Physical Review A article Computer Science Quantum Computing Algorithms and Architecture Open access
Vrinda Mehta, Fengping Jin, Hans A. De Raedt, Kristel F. L. Michielsen
11citations -
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings2020 Journal of Logical and Algebraic Methods in Programming article Computer Science Polynomial and algebraic computation Open access
Erika Ábrahám, James H. Davenport, Matthew England, Gereon Kremer
34citations -
Computing high-degree polynomial gradients in memory2024 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
22citations -
veriSIMPLER: An Automated Formal Verification Methodology for SIMPLER MAGIC Design Style Based In-Memory Computing2024 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
7citations -
Health literacy, information provision and satisfaction in advanced cancer consultations: two observational studies using level of education as a proxy2021 BMJ Supportive & Palliative Care article Health Professions Health Literacy and Information Accessibility
Liesbeth Mirjam van Vliet, Janneke Noordman, Marit Mijnlieff, Ruud T. J. Roodbeen, Gudule Boland, Sandra van Dulmen
7citations