Lightsolver challenges a leading deep learning solver for Max-2-SAT problems

02/14/2023
by   Hod Wirzberger, et al.
0

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 a leading deep-learning solver for the MAX-2-SAT problem. Experiments on benchmark data sets show that LightSolver achieves significantly smaller time-to-optimal-solution compared to a state-of-the-art deep-learning algorithm, where the gain in performance tends to increase with the problem size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2020

Learning from Survey Propagation: a Neural Network for MAX-E-3-SAT

Many natural optimization problems are NP-hard, which implies that they ...
research
01/20/2018

A high-performance analog Max-SAT solver and its application to Ramsey numbers

We introduce a continuous-time analog solver for MaxSAT, a quintessentia...
research
09/12/2018

The Curse and Blessing of Not-All-Equal in k-Satisfiability

We study upper bounds for the running time of algorithms for NAE-k-SAT a...
research
05/14/2019

Generating Weighted MAX-2-SAT Instances of Tunable Difficulty with Frustrated Loops

Many optimization problems can be cast into the maximum satisfiability (...
research
01/15/2014

Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem

The survey propagation (SP) algorithm has been shown to work well on lar...
research
10/23/2017

Evidence of an exponential speed-up in the solution of hard optimization problems

Optimization problems pervade essentially every scientific discipline an...
research
06/17/2023

Co-Certificate Learning with SAT Modulo Symmetries

We present a new SAT-based method for generating all graphs up to isomor...

Please sign up or login with your details

Forgot password? Click here to reset