Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Weakly NP-Complete
CHF 43.20
Auf Lager
SKU
BTD33CVSAU5
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
High Quality Content by WIKIPEDIA articles! In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard), if there is an algorithm for the problem whose running time is polynomial in the dimension of the problem and the magnitudes of the data involved (provided these are given as integers), rather than the base-two logarithms of their magnitudes. Such algorithms are technically exponential functions of their input size and are therefore not considered polynomial. For example, the NP-hard knapsack problem can be solved by a dynamic programming algorithm requiring a number of steps polynomial in the size of the knapsack and the number of items (assuming that all data are scaled to be integers). This algorithm is exponential time since the input sizes of the objects and knapsack are logarithmic in their magnitudes.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131194191
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131194191
- Format Fachbuch
- Titel Weakly NP-Complete
- Herausgeber Betascript Publishing
- Anzahl Seiten 84
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
