1. Shodhganga@INFLIBNET
  2. SNDT Womens University
  3. Department of Computer Science
Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/193686
Title: Computational complexity of encryption related to the boolean satisfiability problem
Researcher: Singh, Sarita
Guide(s): Ramani, S
Keywords: Encryption, Boolean, Cryptography, Models of Computation
University: SNDT Womens University
Completed Date: 2003
Abstract: Abstract not available newline newline
Pagination: 201p.
URI: http://hdl.handle.net/10603/193686
Appears in Departments:Department of Computer Science

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File53.74 kBAdobe PDFView/Open
02_certificate.pdf54.42 kBAdobe PDFView/Open
03_declaration.pdf77.22 kBAdobe PDFView/Open
04_content.pdf138.26 kBAdobe PDFView/Open
05_list of appendices.pdf51.12 kBAdobe PDFView/Open
06_list of figures.pdf56.55 kBAdobe PDFView/Open
07_list of tables.pdf53.44 kBAdobe PDFView/Open
08_chapter 1.pdf308.81 kBAdobe PDFView/Open
09_chapter 2.pdf410.61 kBAdobe PDFView/Open
10_chapter 3.pdf345.37 kBAdobe PDFView/Open
11_chapter 4.pdf419.32 kBAdobe PDFView/Open
12_chapter 5.pdf336.15 kBAdobe PDFView/Open
13_chapter 6.pdf533.09 kBAdobe PDFView/Open
14_chapter 7.pdf411.68 kBAdobe PDFView/Open
15_chapter 8.pdf290.36 kBAdobe PDFView/Open
16_chapter 9.pdf212.97 kBAdobe PDFView/Open
17_glossary.pdf133.95 kBAdobe PDFView/Open
18_bibliography and appendices.pdf468.82 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: