No article text was recorded for this version.
computational complexity of width recognition
Version 1 of 17 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Complexity Analysis of Generalized and Fractional Hypertree Decompositions
- Blog: A More General Theory of Static Approximations for Conjunctive Queries
- Blog: FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
- Blog: Constraint Solving via Fractional Edge Covers
- Blog: Hypergraph Cuts with General Splitting Functions
- Blog: Hypertree-decomposition via Branch-decomposition
- Blog: Computing Optimal Hypertree Decompositions with SAT
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_of_width_recogn_1a2954d4,
title = {computational complexity of width recognition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-width-recognition/rdr_1a2954d4110b4daf8ec2305de9919122},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_complexity_of_width_recogn_1a2954d4_v1,
title = {computational complexity of width recognition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-width-recognition/rdr_1a2954d4110b4daf8ec2305de9919122/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}