Paper ID: 2411.10453

Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)

Gabriel Istrate

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.

Submitted: Oct 31, 2024