e/Strongly NP-complete

New Query

Information
has glosseng: 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.
lexicalizationeng: strongly NP-complete
instance ofc/Strongly NP-complete problems
Meaning
Polish
has glosspol: 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.
lexicalizationpol: Problem silnie NP zupełny
lexicalizationpol: Problem silnie NP-zupełny

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint