Tensor Network Contractions for #SAT
Tensor Network Contractions for #SAT
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding individual satisfying solutions is computationally easy (e.g. 2-SAT, which is in
P
), determining the number of solutions can be #
P
-hard. Recently, computational...
Alternative Titles
Full title
Tensor Network Contractions for #SAT
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_gale_infotracacademiconefile_A438183532
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_gale_infotracacademiconefile_A438183532
Other Identifiers
ISSN
0022-4715
E-ISSN
1572-9613
DOI
10.1007/s10955-015-1276-z
