Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/507844
Full metadata record
DC FieldValueLanguage
dc.coverage.spatial
dc.date.accessioned2023-08-18T11:19:24Z-
dc.date.available2023-08-18T11:19:24Z-
dc.identifier.urihttp://hdl.handle.net/10603/507844-
dc.description.abstractnewline No
dc.format.extentxiv, 198p
dc.languageEnglish
dc.relation
dc.rightsuniversity
dc.titleComplexity theory of higher type functionals
dc.title.alternative
dc.creator.researcherSeth, Anil
dc.subject.keywordAxiomatization
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Artificial Intelligence
dc.subject.keywordEngineering and Technology
dc.subject.keywordFeasible Functionals
dc.subject.keywordMachine Characterization
dc.subject.keywordPolynomial
dc.subject.keywordTransformrs
dc.description.note
dc.contributor.guideShyamasundar, R K
dc.publisher.placeMumbai
dc.publisher.universityUniversity of Mumbai
dc.publisher.institutionComputer Science, Tata Institute of Fundamental Research
dc.date.registered
dc.date.completed1994
dc.date.awarded
dc.format.dimensions
dc.format.accompanyingmaterialDVD
dc.source.universityUniversity
dc.type.degreePh.D.
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


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

Altmetric Badge: