Home > Term: P
P
The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
- 100% positive feedback