Skorzystaj z wyszukiwarki lub indeksu alfabetycznego.
Przykłady: pci, /dev/null, functional unit, embedded system, pseudo-tty, nfs.
1 definition found From The Free On-line Dictionary of Computing (05 January 2017) [foldoc]: provably difficult The set or property of problems for which it can be proven that no polynomial-time algorithm exists, only exponential-time algorithms.