Home > Term: P
P
The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time.
- Besedna vrsta: noun
- Industrija/področje: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Avtor
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
