| Type of Material: | Thesis |
| Title: | Computational complexity of encryption related to the boolean satisfiability problem |
| Researcher: | Singh, Sarita |
| Guide: | Ramani, S |
| Publisher: | SNDT Womens University |
| Place: | Mumbai |
| Language: | English |
| Dissertation/Thesis Note: | PhD |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 423844 | |
| 003 | IN-AhILN | |
| 005 | 2018-08-15 12:37:48 | |
| 008 | __ | 180815t####||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_423844 |
| 040 | __ | |aSNDT_400020|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aSingh, Sarita|eResearcher |
| 245 | __ | |aComputational complexity of encryption related to the boolean satisfiability problem |
| 260 | __ | |aMumbai|bSNDT Womens University |
| 502 | __ | |bPhD |
| 700 | __ | |aRamani, S|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/193686|yShodhganga |
| 905 | __ | |anotification |
User Feedback Comes Under This section.