Sums-of-Products and Subproblem Independence

DOI10.1007/978-1-4020-9688-4_11zbMath1176.68086OpenAlexW1530809733MaRDI QIDQ5192363

Richard E. Stearns, Harry B. III Hunt

Publication date: 5 August 2009

Published in: Fundamental Problems in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-9688-4_11

zbMATH Keywords

computational complexitytreewidthgeneric algorithmstree decompositionsconstraint satisfaction problemsstructure treesquantifiersquantified sumssums-of-products

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Sums-of-Products and Subproblem Independence