Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    Complexity aspects of guessing prefix codes (1994)
    Springer
    Algorithmica 12 (1994), S. 409-419 
    Details
    ISSN: 1432-0541
    Keywords: Prefix codes ; Huffman codes ; Encryption ; Complexity ; NP-completeness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a natural language cleartext and a ciphertext obtained by Huffman coding, the problem of guessing the code is shown to be NP-complete for various variants of the encoding process.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01185434
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...