3 papers
cs.LG2026
Learning to Solve the Quadratic Assignment Problem with Warm-Started MCMC Finetuning
Yicheng Pan, Ruisong Zhou, Haijun Zou +2
The quadratic assignment problem (QAP) is a fundamental NP-hard task that poses significant challenges for both traditional heuristics and modern learning-based solvers. Existing Q…
cs.CC2025
Dichotomies for \#CSP on graphs that forbid a clique as a minor
Boning Meng, Yicheng Pan
We prove complexity dichotomies for \#CSP problems (not necessarily symmetric) with Boolean domain and complex range on several typical minor-closed graph classes. These dichotomie…
math.CO2025
Matchgate signatures under variable permutations
Boning Meng, Yicheng Pan
In this article, we give a sufficient and necessary condition for determining whether a matchgate signature retains its property under a certain variable permutation, which can be…