Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during...
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
About this item
Full title
Author / Creator
Publisher
Cham: Springer International Publishing
Journal title
Language
English
Formats
Publication information
Publisher
Cham: Springer International Publishing
Subjects
More information
Scope and Contents
Contents
There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some forms of structure, such as properties of the underlying constraint graph, are “easily” identifiable. Others, such as backdoor sets, are of interest because they capture key aspects o...
Alternative Titles
Full title
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1551082644
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1551082644
Other Identifiers
ISSN
1012-2443
E-ISSN
1573-7470
DOI
10.1007/s10472-014-9407-9
