3 citations · 3 across the 2 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2023
Lightsolver challenges a leading deep learning solver for Max-2-SAT problems
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…
quant-ph2022★ 3 cited
LightSolver -- A New Quantum-inspired Solver Cracks the 3-Regular 3-XORSAT Challenge
Idan Meirzada, Assaf Kalinski, Dov Furman +5
The increasing complexity of required computational tasks alongside the inherent limitations in conventional computing calls for disruptive innovation. LightSolver devised a new qu…