1 paper
Hod Wirzberger, Assaf Kalinski, Idan Meirzada +4
Maximum 2-satisfiability (MAX-2-SAT) is a type of combinatorial decision problem that is known to be NP-hard. In this paper, we compare LightSolver's quantum-inspired algorithm to…