Category:Definitions/Type P Problems
Jump to navigation
Jump to search
This category contains definitions related to Type P Problems.
Related results can be found in Category:Type P Problems.
A type P problem is a decision problem which can be solved by an algorithm running in polynomial time.
Pages in category "Definitions/Type P Problems"
This category contains only the following page.