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

arXiv: https://arxiv.org/abs/2411.10453 · HTML: https://mlsanity.com/paper/2411.10453/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 50 references that are in the map.
- First posted on arXiv 31 Oct 2024.

## Builds on (most cited first, 2 of 2)

- [The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials](https://mlsanity.com/paper/2106.02129/) (2021)
- [Local consistency as a reduction between constraint satisfaction problems](https://mlsanity.com/paper/2301.05084/) (2023)

## Abstract (arXiv)

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.