2000 character limit reached
Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP) (2411.10453v1)
Published 31 Oct 2024 in cs.CC, cs.AI, and cs.DM
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.