Parameterized Complexity Analysis of Computer Algorithms
(Sprache: Englisch)
The present book makes a statistical assessment of the influence of parameters of input probability distribution on the time complexity of some of the computer algorithms in sequential computing paradigm. Such investigations in parameterized complexity...
Leider schon ausverkauft
versandkostenfrei
Buch
64.90 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Parameterized Complexity Analysis of Computer Algorithms “
Klappentext zu „Parameterized Complexity Analysis of Computer Algorithms “
The present book makes a statistical assessment of the influence of parameters of input probability distribution on the time complexity of some of the computer algorithms in sequential computing paradigm. Such investigations in parameterized complexity offer a challenging, new and very interesting research area involving extensive statistical modeling given that theoretical analysis in such problems turns out to be complex.
Bibliographische Angaben
- Autoren: Mita Pal , Soubhik Chakraborty , N. C. Mahanti
- 2017, 164 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: LAP Lambert Academic Publishing
- ISBN-10: 3330347449
- ISBN-13: 9783330347441
Sprache:
Englisch
Kommentar zu "Parameterized Complexity Analysis of Computer Algorithms"
0 Gebrauchte Artikel zu „Parameterized Complexity Analysis of Computer Algorithms“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Parameterized Complexity Analysis of Computer Algorithms".
Kommentar verfassen