Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)
Computational Complexity
2024-11-19 v1 Artificial Intelligence
Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2411.10453,
title = {Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)},
author = {Gabriel Istrate},
journal= {arXiv preprint arXiv:2411.10453},
year = {2024}
}
Comments
In Proceedings FROM 2024, arXiv:2410.23020. An extended version is under preparation and will also be posted on arXiv