DSpace Repository
Modification of bos & coster's heuristics in search of a shorter addition chain for faster exponentiation
- DSpace Home
- →
- Dissertation and Thesis
- →
- Dissertations - M Tech (CS)
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Nandy, Ayan | |
| dc.date.accessioned | 2016-07-08T20:01:23Z | |
| dc.date.available | 2016-07-08T20:01:23Z | |
| dc.date.issued | 2011 | |
| dc.identifier.citation | 33p. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/6419 | |
| dc.description | Dissertation under the supervision of Prof. Palash Sarkar, AS Unit | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Indian Statistical Institute, Kolkata | en_US |
| dc.relation.ispartofseries | Dissertation;2011-264 | |
| dc.subject | Double base number system | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Data compression | en_US |
| dc.title | Modification of bos & coster's heuristics in search of a shorter addition chain for faster exponentiation | en_US |
| dc.type | Thesis | en_US |
Files in this item
This item appears in the following Collection(s)
-
Dissertations - M Tech (CS)
M Tech (Computer Science)