No article text was recorded for this version.
domain size scalability
Version 1 of 110 papers12 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Exploring Directional Path-Consistency for Solving Constraint Networks
- Blog: The Complexity of Boolean Constraint Isomorphism
- Blog: Minimal Distance of Propositional Models
- Blog: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
- Blog: Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs
- Blog: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
- Blog: A Topological Version of Schaefer's Dichotomy Theorem
- Blog: Basis Collapse for Holographic Algorithms Over All Domain Sizes
- Blog: The Complexity of Holant Problems over Boolean Domain with Non-negative Weights
- Blog: NP-Completeness of Outcome Optimization for Partial CP-Nets
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_domain_size_scalability_c2f1d15c,
title = {domain size scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/domain-size-scalability/rdr_c2f1d15c83a34401816d0c28b1dba92e},
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_domain_size_scalability_c2f1d15c_v1,
title = {domain size scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/domain-size-scalability/rdr_c2f1d15c83a34401816d0c28b1dba92e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}