| Information | |
|---|---|
| has gloss | eng: In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. A general computational problem may have numerical parameters. For example, the input to the Bin packing problem is a list of objects of specific sizes and a size for the bins that must contain the objects—these object sizes and bin size are numerical parameters. |
| lexicalization | eng: strongly NP-complete |
| instance of | c/Strongly NP-complete problems |
| Meaning | |
|---|---|
| Polish | |
| has gloss | pol: Problemy silnie NP-zupełne to takie problemy decyzyjne, które nawet przy ograniczeniu maksymalnej wartości występujacych w ich opisie liczb pozostają NP-zupełne. |
| lexicalization | pol: Problem silnie NP zupełny |
| lexicalization | pol: Problem silnie NP-zupełny |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint