Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/507844
Title: Complexity theory of higher type functionals
Researcher: Seth, Anil
Guide(s): Shyamasundar, R K
Keywords: Axiomatization
Computer Science
Computer Science Artificial Intelligence
Engineering and Technology
Feasible Functionals
Machine Characterization
Polynomial
Transformrs
University: University of Mumbai
Completed Date: 1994
Abstract: newline No
Pagination: xiv, 198p
URI: http://hdl.handle.net/10603/507844
Appears in Departments:Computer Science, Tata Institute of Fundamental Research

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File169.54 kBAdobe PDFView/Open
02_prelim pages.pdf729.68 kBAdobe PDFView/Open
03_contents.pdf762.33 kBAdobe PDFView/Open
04_chapter 1.pdf3.21 MBAdobe PDFView/Open
05_chapter 2.pdf8.96 MBAdobe PDFView/Open
06_chapter 3.pdf8.58 MBAdobe PDFView/Open
07_chapter 4.pdf6.82 MBAdobe PDFView/Open
08_chapter 5.pdf5.27 MBAdobe PDFView/Open
09_chapter 6.pdf10.61 MBAdobe PDFView/Open
10_chapter 7.pdf434.67 kBAdobe PDFView/Open
11_annexures.pdf4.07 MBAdobe PDFView/Open
80_recommendation.pdf602.29 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: