Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/375918
Title: Communication Complexity and Quantum Optimization Lower Bounds via Query Complexity
Researcher: Suhail Sherif
Guide(s): Arkadev Chattopadhyay
Keywords: Engineering and Technology
Computer Science
Computer Science Information Systems
University: Tata Institute of Fundamental Research
Completed Date: 2022
Abstract: newline
Pagination: 
URI: http://hdl.handle.net/10603/375918
Appears in Departments:School of Technology and Computer Science (STCS)

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File128.08 kBAdobe PDFView/Open
02_declaration.pdf169.73 kBAdobe PDFView/Open
03_contents.pdf298.74 kBAdobe PDFView/Open
04_chapter 1.pdf1.48 MBAdobe PDFView/Open
05_chapter 2.pdf1.14 MBAdobe PDFView/Open
06_chapter 3.pdf2.77 MBAdobe PDFView/Open
07_chapter 4.pdf1.05 MBAdobe PDFView/Open
08_chapter 5.pdf997.83 kBAdobe PDFView/Open
09_chapter 6.pdf1.6 MBAdobe PDFView/Open
10_chapter 7.pdf1.09 MBAdobe PDFView/Open
11_bibliography.pdf450.04 kBAdobe PDFView/Open
80_recommendation.pdf321.03 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: