output
20172025
most citedToward Orbital-Free Density Functional Theory with Small Data Sets and Deep Learning

47 citations

researchers with a paper here
collaborating institutions
Showing 2025Show all

2 papers · 1 filter

cs.ET2025

Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing

Haesol Im, Fabian Böhm, Giacomo Pedretti +14

The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…

math.OC2025

Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem

Haesol Im, Chan-Woo Yang, Moslem Noori +10

Research into the development of special-purpose computing architectures designed to solve quadratic unconstrained binary optimization (QUBO) problems has flourished in recent year…