---
tag: 3A81RHAN68
kind: concept
name: Deterministic polynomial time
sources:
  - wikipedia: en:76765067@r1368301704
    locator: Glossary of logic, section D
    note: adopted
    mention: wikipedia://en/76765067#ZTYJ
    sections: [Summary]
inventory: [AR9SXWW63D]
---

## Summary

A complexity class (P) consisting of decision problems that can be solved by a deterministic Turing machine in polynomial time.