Home > Term: P
P
The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time.
- Kalbos dalis: noun
- Pramonės šaka / sritis: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Kūrėjas
- GeorgeV
- 100% positive feedback