P-complete
Description: A complexity class of decision problems that are solvable using polynomial space and complete under polynomial-time reductions.
Primary topic: Advanced Graph Theory Research (22%)
Wikidata ID: wiki/Q905789
OpenAlex ID: keywords/p-complete
