weak NP-completeness الإنجليزية (Q533058)
set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes الإنجليزية
| اللغة | التسمية | الوصف | أسماء أخرى |
|---|---|---|---|
| العربية | لم تُضف التسمية |
لا يوجد وصف |
|
| الإنجليزية | weak NP-completeness |
set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes |
|
بيانات
وصلات الموقع
Marefa(٠ : لا وصلات)
ويكيبيديا(٢ وصلتان)
- enwiki Weak NP-completeness
- frwiki NP-complétude faible