The following pages link to (Q4779133):
Displaying 12 items.
- On minimal constraint networks (Q359976) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
- Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
- Weighted 2-sections and hypergraph reconstruction (Q2143117) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- On Sparse Discretization for Graphical Games (Q5130000) (← links)
