NP (Q628036)
Jump to navigation
Jump to search
computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
- NP class
- nondeterministic polynomial
- nondeterministic polynomial time
- nondeterministic polynomial complexity class
- non-deterministic polynomial
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP |
computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time |
|
Statements
Identifiers
1 reference
Sitelinks
Wikipedia(31 entries)
- arwiki كثير حدود غير قطعي
- bgwiki NP-сложност
- bswiki NP (klasa kompleksnosti)
- cawiki NP (Complexitat)
- cswiki NP (třída složitosti)
- dawiki NP
- dewiki NP (Komplexitätsklasse)
- enwiki NP (complexity)
- eswiki NP (clase de complejidad)
- fawiki NP (پیچیدگی)
- fiwiki NP (vaativuusluokka)
- frwiki NP (complexité)
- hewiki NP (מחלקת סיבוכיות)
- itwiki NP (complessità)
- jawiki NP
- kowiki NP (복잡도)
- nlwiki NP (complexiteitsklasse)
- nnwiki NP i kompleksitetsteori
- nowiki NP (kompleksitet)
- plwiki Problem NP
- ptwiki NP (complexidade)
- rowiki NP (teoria complexității)
- ruwiki Класс NP
- srwiki НП (класа комплексности)
- svwiki NP
- thwiki เอ็นพี (ความซับซ้อน)
- trwiki NP (karmaşıklık)
- ukwiki Клас складності NP
- viwiki NP (độ phức tạp)
- zh_yuewiki NP (運算複雜度)
- zhwiki NP (複雜度)