arXiv · 1812.07358
Widely distributed clusters of the constraint satisfaction problem model d-k-CSP
Abstract
Relation between problem hardness and solution space structure is an important research aspect. Model d-k-CSP generates very hard instances when $r=1$ and $r$ is near 1, where $r$ represents normalized constraint density. We find that when $r$ is below and close to 1, the solution space contains many widely distributed well-separated small cluster-regions (a cluster-region is a union of some clusters), which should the reason that the generated instances are hard to solve.
Explore related subjects
Keep this discovery
Wei Xu, Fuzhou Gong, Guangyan Zhou. 2018-12-18. Widely distributed clusters of the constraint satisfaction problem model d-k-CSP. https://arxiv.org/abs/1812.07358
Cite the original work for its findings. Save a collection to share your selection of sources.