self-reducibility
Description: A property in computational complexity in which a problem can be reduced to itself, enabling parts of an instance to be solved through related instances.
Primary topic: Complexity and Algorithms in Graphs (57%)
OpenAlex ID: keywords/self-reducibility
