Fanout limitations on constraint systems
From MaRDI portal
Publication:5941073
DOI10.1016/S0304-3975(99)00288-1zbMath0973.68073MaRDI QIDQ5941073
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (5)
On Planar Boolean CSP ⋮ The complexity of approximating bounded-degree Boolean \(\#\)CSP ⋮ A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ On the Complexity of Holant Problems
Cites Work
- On the complexity of H-coloring
- List homomorphisms to reflexive graphs
- Matroid matching and some applications
- The complexity of circuit value and network stability
- On the Structure of Polynomial Time Reducibility
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- Stable networks and product graphs
- The complexity of satisfiability problems
This page was built for publication: Fanout limitations on constraint systems
