Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

A Computer Experiment Oriented Approach to Algorithmic Complexity

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 5,066

Availability: In stock

 
  • Product Description
 

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.

Product Specifications
SKU :COC16270
AuthorSoubhik Chakraborty and Suman Kumar Sourabh
LanguageEnglish
BindingPaperback
Number of Pages192
Publishing Year6/30/2010
ISBN978-3838377438
Edition1 st
Book TypeComputing & information technology
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-25 00:00:00