Login / Signup
Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP.
Marcus Bjäreland
Peter Jonsson
Published in:
CP (1999)
Keyphrases
</>
np complete
constraint satisfaction problems
evolutionary algorithm
database
constraint satisfaction
hypertree decomposition
reinforcement learning
computational complexity
lower bound
constraint propagation