Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/541855
Title: On Complexity Measures of Boolean Functions
Researcher: Tulasi Mohan Molli
Guide(s): Prahladh Harsha
Keywords: Engineering and Technology
Computer Science
Computer Science Interdisciplinary Applications
University: Tata Institute of Fundamental Research
Completed Date: 2023
Abstract: newline
Pagination: 
URI: http://hdl.handle.net/10603/541855
Appears in Departments:School of Technology and Computer Science (STCS)

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File36.09 kBAdobe PDFView/Open
02_prelim pages.pdf123.18 kBAdobe PDFView/Open
03_contents.pdf54.08 kBAdobe PDFView/Open
04_abstract.pdf142.83 kBAdobe PDFView/Open
05_chapter 1.pdf190.03 kBAdobe PDFView/Open
06_chapter 2.pdf220.71 kBAdobe PDFView/Open
07_chapter 3.pdf312.08 kBAdobe PDFView/Open
08_chapter 4.pdf464.03 kBAdobe PDFView/Open
10_annexures.pdf205.09 kBAdobe PDFView/Open
80_recommendation.pdf225.45 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: