Home >  Term: P
P

The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time.

0 0

Creator

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.