arXiv:2411.10453cs.CCcs.AI2024-11
提出保持几何结构的规约方法,研究约束满足问题间的转换规律。
Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)
- 定义两类保持问题几何结构的规约方式
- 给出多个应用实例与反例验证其有效性
- 适用于研究组合优化中的相变现象
受组合优化问题中相变现象的启发,我们定义了两类在约束满足问题与其他NP搜索问题之间保持几何结构的规约。文中提供了若干例子与反例来说明这些规约的应用与局限性。
原文摘要 · Abstract (English)
Motivated by phase transitions in combinatorial optimization problems, we define two kinds of geometry-preserving reductions between constraint satisfaction problems and other NP-search problems. We give a couple of examples and counterexamples for these reductions.
约束满足复杂性理论相变
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。