Source: wikibot/p-complete-problems
= P-complete problems
{wiki=Category:P-complete_problems}
P-complete problems are a class of problems in computational complexity theory that are considered to be the "hardest" problems within the complexity class P, which consists of all decision problems that can be solved in polynomial time by a deterministic Turing machine.