1. Shodhganga@INFLIBNET
  2. Swami Ramanand Teerth Marathwada University
  3. Department of Computer Science
Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/214985
Title: Axiomatically analyzing complexity behaviour of tree searching algorithms and characterization of fuzzy tree searches
Researcher: Bhalchandra, Parag Upendra
Guide(s): D, Khamitkar S
Keywords: Axiomatic
Brute-force
Constraint
Hanoi
Heuristic
University: Swami Ramanand Teerth Marathwada University
Completed Date: 2014
Abstract: Abstract not available
Pagination: xx, 221p.
URI: http://hdl.handle.net/10603/214985
Appears in Departments:Department of Computer Science

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File50.63 kBAdobe PDFView/Open
02_declaration.pdf48.11 kBAdobe PDFView/Open
03_certificate.pdf37.03 kBAdobe PDFView/Open
04_acknowledgement.pdf71.96 kBAdobe PDFView/Open
05_index.pdf44.37 kBAdobe PDFView/Open
06_abbreviation.pdf17.41 kBAdobe PDFView/Open
07_list of table.pdf119.55 kBAdobe PDFView/Open
08_list of figures and graphs.pdf99.32 kBAdobe PDFView/Open
09_preface.pdf448.18 kBAdobe PDFView/Open
10_chapter 1.pdf1.11 MBAdobe PDFView/Open
11_chapter 2.pdf685.64 kBAdobe PDFView/Open
12_chapter 3.pdf691.08 kBAdobe PDFView/Open
13_chapter 4.pdf1.93 MBAdobe PDFView/Open
14_chapter 5.pdf1.77 MBAdobe PDFView/Open
15_chapter 6.pdf4.27 MBAdobe PDFView/Open
16_chapter 7.pdf1.45 MBAdobe PDFView/Open
17_chapter 8.pdf783.39 kBAdobe PDFView/Open
18_chapter 9.pdf260.68 kBAdobe PDFView/Open
19_bibliography.pdf508.68 kBAdobe PDFView/Open
20_appendix.pdf1.21 MBAdobe 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: