A Computer Experiment Oriented Approach to Algorithmic Complexity | Computer Applications of Statistics

Soubhik Chakraborty (u. a.)

ISBN 10: 3838377435 / ISBN 13: 9783838377438

Published by LAP LAMBERT Academic Publishing, 2010

About this Item

A Computer Experiment Oriented Approach to Algorithmic Complexity | Computer Applications of Statistics | Soubhik Chakraborty (u. a.) | Taschenbuch | 192 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838377438 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Seller Inventory # 101015076

Bibliographic Details

• Title: A Computer Experiment Oriented Approach to Algorithmic Complexity | Computer Applications of Statistics
• Publisher: LAP LAMBERT Academic Publishing
• Publication Date: 2010
• Language: English
• ISBN 10: 3838377435
• ISBN 13: 9783838377438
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 12D millimeters 220 millimeters width by 150 millimeters height by 12 millimeters depth
• Weight: 304 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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 statistical bounds safeguard against making tall optimistic claims for the best cases. In short the statistical bounds have a sense of "calculated guarantee" that is neither too risky nor too conservative. In parallel computing, with every change of the processor, it can be argued that it is the weight of the operation that changes. Hence, if the bound is itself based on weights, it should be deemed as the ideal one.

About the Author

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.