No article text was recorded for this version.
computational intractability of CSPs
Version 1 of 126 papers28 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
- Blog: A Game-Theoretic Approach to Constraint Satisfaction
- Blog: A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition
- Blog: The Complexity Landscape of Decompositional Parameters for ILP
- Blog: An Algebra for Cyclic Ordering of 2D Orientations
- Blog: A Comparison of Structural CSP Decomposition Methods
- Blog: On the Minimality and Decomposability of Constraint Networks
- Blog: On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows
- Blog: Combining RCC-8 with Qualitative Direction Calculi: Algorithms and Complexity
- Blog: A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems
- Blog: A Dichotomy for 2-Constraint Forbidden CSP Patterns
- Blog: On the Hardness of Approximate Reasoning Dan Roth
- Blog: 09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability
- Blog: Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
- Blog: A Comparison of Structural CSP Decomposition
- Blog: Fast Algorithm for Connected Row Convex Constraints
- Blog: A Maximal Tractable Class of Soft Constraints
- Blog: Constraint Solving via Fractional Edge Covers
- Blog: Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes
- Blog: The Complexity Landscape of Resource-Constrained Scheduling
- Blog: Tractable Tree Convex Constraint Networks
- Blog: Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable
- Blog: Functional Elimination and 0/1/All Constraints
- Blog: 06401 Abstracts Collection - Complexity of Constraints
- Blog: Complexity classifications for different equivalence and audit problems for Boolean circuits
- Blog: Computational Aspects of Cooperative Game Theory
History & citation
Current · Permanent link
- This direction split from Mapping the Boundary of Computational Tractability (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_intractability_of_csps_4524715e,
title = {computational intractability of CSPs},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-intractability-of-csps/rdr_4524715ef2d246e39b002f01141be43d},
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_intractability_of_csps_4524715e_v1,
title = {computational intractability of CSPs},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-intractability-of-csps/rdr_4524715ef2d246e39b002f01141be43d/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}