Deterministic polynomial time
Summary
A complexity class (P) consisting of decision problems that can be solved by a deterministic Turing machine in polynomial time.
Further reading
- Wikipedia, page 76765067, revision 1368301704, Glossary of logic, section D. adopted
About this page
| Tag | 3A81RHAN68 |
|---|---|
| URI | m2://3A81RHAN68 |
| Kind | concept |
| Writing | W1 stated |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.