Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/379988
Title: Complexity Measures of Boolean Functions Fourier Sparsity Fourier Dimension and Query Complexity
Researcher: Swagato Sanyal
Guide(s): Prahladh Harsha
Keywords: Engineering and Technology
Computer Science
Computer Science Information Systems
University: Tata Institute of Fundamental Research
Completed Date: 2017
Abstract: newline
Pagination: 
URI: http://hdl.handle.net/10603/379988
Appears in Departments:School of Technology and Computer Science (STCS)

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File198.59 kBAdobe PDFView/Open
02_declaration.pdf167.12 kBAdobe PDFView/Open
04_acknowledgment.pdf31.64 kBAdobe PDFView/Open
05_contents.pdf39.31 kBAdobe PDFView/Open
07_abstract.pdf52.42 kBAdobe PDFView/Open
08_chapter 1.pdf84.43 kBAdobe PDFView/Open
09_chapter 2.pdf158.43 kBAdobe PDFView/Open
10_chapter 3.pdf141.96 kBAdobe PDFView/Open
11_chapter 4.pdf112.33 kBAdobe PDFView/Open
12_chapter 5.pdf150.46 kBAdobe PDFView/Open
13_chapter 6.pdf149.26 kBAdobe PDFView/Open
14_chapter 7.pdf170.65 kBAdobe PDFView/Open
15_references.pdf66.54 kBAdobe PDFView/Open
16_credits.pdf59.1 kBAdobe PDFView/Open
17_synopsis.pdf595.14 kBAdobe PDFView/Open
80_recommendation.pdf389.85 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: