Change search
ReferencesLink to record
Permanent link

Direct link
The backtracking survey propagation algorithm for solving random K-SAT problems
Stockholm University, Nordic Institute for Theoretical Physics (Nordita).
Number of Authors: 3
2016 (English)In: Nature Communications, ISSN 2041-1723, E-ISSN 2041-1723, Vol. 7, 12996Article in journal (Refereed) Published
Abstract [en]

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances. Moreover, it is still unclear what are the key features that make a discrete combinatorial optimization problem hard to solve. Here we study random K-satisfiability problems with K = 3,4, which are known to be very hard close to the SAT-UNSAT threshold, where problems stop having solutions. We show that the backtracking survey propagation algorithm, in a time practically linear in the problem size, is able to find solutions very close to the threshold, in a region unreachable by any other algorithm. All solutions found have no frozen variables, thus supporting the conjecture that only unfrozen solutions can be found in linear time, and that a problem becomes impossible to solve in linear time when all solutions contain frozen variables.

Place, publisher, year, edition, pages
2016. Vol. 7, 12996
National Category
Other Natural Sciences
URN: urn:nbn:se:su:diva-136079DOI: 10.1038/ncomms12996ISI: 000385537300002PubMedID: 27694952OAI: diva2:1056301
Available from: 2016-12-14 Created: 2016-11-29 Last updated: 2016-12-14Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textPubMed

Search in DiVA

By author/editor
Marino, Raffaele
By organisation
Nordic Institute for Theoretical Physics (Nordita)
In the same journal
Nature Communications
Other Natural Sciences

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 5 hits
ReferencesLink to record
Permanent link

Direct link