Parameterized Complexity
CHF 42.90
Auf Lager
SKU
6F205K94H34
1 Verfügbar
Geliefert zwischen Mo., 22.09.2025 und Di., 23.09.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Parameterized complexity is a branch of computational complexity theory in computer science that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input. In parameterized complexity, the complexity of a problem is measured as a function in two or more parameters of the input. This way, parameterized complexity achieves to classify NP-hard problems on a finer scale than this is possible in the classical setting, where the complexity of a problem is only measured by the number of bits in the input. The first systematic work on parameterized complexity was done by Downey & Fellows (1999).
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131261282
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Genre Mathematik
- Größe H220mm x B220mm
- EAN 9786131261282
- Format Fachbuch
- Titel Parameterized Complexity
- Herausgeber Betascript Publishing
- Anzahl Seiten 76
Bewertungen
Schreiben Sie eine Bewertung
