pseudo-polynomial time
Term in Complexity Theory
Facts
3 properties- Instance of
- complexity class
- Has part(s)
- weak NP-completeness[2]
- Has parts
- weak NP-completeness
🏷️ Also known as
en pseudo-polynomial time
cs pseudopolynomická časová složitost
cs pseudopolynomiální časová složitost
de Pseudopolynomiell
es tiempo pseudo-polinomico
es tiempo seudopolinómico
fr temps de calcul pseudo-polynomial
id waktu semu-polinomial
it tempo pseudopolinomiale
pl algorytm pseudowielomianowy
pt pseudo-tempo polinomial
ro timp pseudo-polinomial
ru псевдополиномиальный алгоритм
uk псевдополіноміальний алгоритм
zh 伪多项式时间
🔖 Identifiers · 3
- Freebase ID
- /m/08vmbm
- Microsoft Academic ID (discontinued)
- 167907120
- Topic's main category
- Category:Pseudo-polynomial time algorithms
🔗 Connections
Instance of 1
Press Enter · cited answer in seconds
0 sources
Summary
pseudo-polynomial time is a complexity class[1].