Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
Boolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision problems or Max k -SAT optimization problems, with co...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2025-01-01
|
| Series: | New Journal of Physics |
| Subjects: | |
| Online Access: | https://doi.org/10.1088/1367-2630/ada572 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|