1. Shodhganga@INFLIBNET
  2. University of Rajasthan
  3. Department of Mathematics
Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/148188
Title: A study of computational complexity of algorithms for numerical methods
Researcher: Ruhela, Dinesh Singh
Guide(s): Jat, R N
Keywords: Algorithm
Complexity
Computational
Study
University: University of Rajasthan
Completed Date: 2014
Abstract: None
Pagination: 166 p.
URI: http://hdl.handle.net/10603/148188
Appears in Departments:Department of Mathematics

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File1.39 MBAdobe PDFView/Open
02_dedicated.pdf3.72 MBAdobe PDFView/Open
03_certificate.pdf240.71 kBAdobe PDFView/Open
04_acknowlegdement.pdf23.88 kBAdobe PDFView/Open
05_contents.pdf19.86 kBAdobe PDFView/Open
06_list of tables figures.pdf23.58 kBAdobe PDFView/Open
07_chapter 1.pdf377.36 kBAdobe PDFView/Open
08_chapter 2.pdf383.32 kBAdobe PDFView/Open
09_chapter 3.pdf384.88 kBAdobe PDFView/Open
10_chapter 4.pdf7.45 MBAdobe PDFView/Open
11_chapter 5.pdf6.71 MBAdobe PDFView/Open
12_chapter 6.pdf432.44 kBAdobe PDFView/Open
13_chapter 7.pdf8.29 MBAdobe PDFView/Open
14_bibliography.pdf308.34 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: