No article text was recorded for this version.
computational intractability of optimal decomposition
Version 1 of 110 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Optimal decomposition of belief networks
- Blog: A Join-Based Hybrid Parameter for Constraint Satisfaction
- Blog: A Comparison of Structural CSP Decomposition
- Blog: On the Space-Time Trade-off in Solving Constraint Satisfaction Problems
- Blog: A Comparison of Structural CSP Decomposition Methods
- Blog: Backdoor Trees
- Blog: Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs
- Blog: A Scalable Jointree Algorithm for Diagnosability
- Blog: From Relational Databases to Belief Networks
- Blog: Model-Based Diagnosis using Structured System Descriptions
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_intractability_of_optimal__458dd216,
title = {computational intractability of optimal decomposition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-intractability-of-optimal-decomposition/rdr_458dd216a61a44b3ab97cb183dd989a9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_intractability_of_optimal__458dd216_v1,
title = {computational intractability of optimal decomposition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-intractability-of-optimal-decomposition/rdr_458dd216a61a44b3ab97cb183dd989a9/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}