Widely distributed clusters of the constraint satisfaction problem model d-k-CSP
Disordered Systems and Neural Networks
2019-04-09 v2
Abstract
Relation between problem hardness and solution space structure is an important research aspect. Model d-k-CSP generates very hard instances when and is near 1, where represents normalized constraint density. We find that when 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.
Cite
@article{arxiv.1812.07358,
title = {Widely distributed clusters of the constraint satisfaction problem model d-k-CSP},
author = {Wei Xu and Fuzhou Gong and Guangyan Zhou},
journal= {arXiv preprint arXiv:1812.07358},
year = {2019}
}