Show simple item record

dc.contributor.authorMaurer, Peter M.
dc.date.accessioned2009-08-04T16:47:04Z
dc.date.available2009-08-04T16:47:04Z
dc.date.issued2009-08-04T16:47:04Z
dc.identifier.urihttp://hdl.handle.net/2104/5362
dc.description.abstractThe objective of the algorithm described in this report is to optimally guess a hidden binary string based on queries to an oracle where the length of the string is known beforehand. A C++ version of the algorithm is given along with a theoretical discussion of why the algorithm works. A discussion of the worst and average-case performance is given along with some discussion of optimality.en
dc.format.extent112420 bytes
dc.format.mimetypeapplication/msword
dc.language.isoen_US
dc.subjectHamming-Distance Oracleen
dc.subjectAlgorithmsen
dc.titleA Search Strategy Using a Hamming-Distance Oracleen
dc.licenseGPLen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record