#P-completeness
Description: A property of computational problems that are complete for the complexity class P under an appropriate reduction, capturing their parallel computation difficulty.
Primary topic: Complexity and Algorithms in Graphs (27%)
Wikidata ID: wiki/Q905789
OpenAlex ID: keywords/p-completeness
