A Computer Experiment Oriented Approach to Algorithmic Complexity
Computer Applications of Statistics
This book forms the much needed strong interface between algorithmic complexity and computer experiments using a careful blending of traditional ideas in algorithms with untraditional research in computer experiments (esp. fitting stochastic models to non-random data). While establishing the aforesaid interface, the important role of statistical bounds and their empirical estimates obtained over a finite range (called empirical O) is discovered as a bonus. While these bounds are very valuable for the average case, our research suggests in addition that there is no need to be over-conservative in the worst case just as the statist…
Mehr
CHF 92.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V105:
Folgt in ca. 15 Arbeitstagen
Produktdetails
Weitere Autoren: Kumar Sourabh, Suman
- ISBN: 978-3-8383-7743-8
- EAN: 9783838377438
- Produktnummer: 37833703
- Verlag: LAP Lambert Academic Publishing
- Sprache: Englisch
- Erscheinungsjahr: 2010
- Seitenangabe: 192 S.
- Masse: H22.0 cm x B15.0 cm x D1.2 cm 304 g
- Abbildungen: Paperback
- Gewicht: 304
Über den Autor
Dr. Soubhik Chakraborty is a Reader, Deptt. of Applied Mathematics, BIT Mesra, Ranchi, India with 50 international papers, an ACM and IEEE Reviewer (Comp. Rev./Trans. Comp.). Dr. Suman Kumar Sourabh is a Sr. Faculty, Deptt. of Statistics and Computer Applications, T. M. Bhagalpur University, Bhagalpur, India with 10 international papers.
17 weitere Werke von Soubhik Chakraborty:
Bewertungen
Anmelden