The backtracking survey propagation algorithm for solving random K-SAT problems
The backtracking survey propagation algorithm for solving random K-SAT problems
About this item
Full title
Author / Creator
Publisher
London: Nature Publishing Group UK
Journal title
Language
English
Formats
Publication information
Publisher
London: Nature Publishing Group UK
Subjects
More information
Scope and Contents
Contents
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
Alternative Titles
Full title
The backtracking survey propagation algorithm for solving random K-SAT problems
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_719c06fe184d4189855a85415a4443c4
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_719c06fe184d4189855a85415a4443c4
Other Identifiers
ISSN
2041-1723
E-ISSN
2041-1723
DOI
10.1038/ncomms12996
