decipherability การใช้

Because of the Immerman Szelepcs閚yi theorem, it follows that unique decipherability is also NL-complete.
The private key forms a poly-sized witness of decipherability or indecipherability, whichever may be the case.
Although the leaked teaser lacked decipherability, the person who had leaked the teaser openly informed the team about it and challenged them to take action against him.
The problem of unique decipherability of a given variable-length code was shown to be co-NL-complete by; Rytter used a variant of the Sardinas Patterson algorithm to show that the complementary problem, finding a string that has multiple ambiguous decodings, belongs to "'NL " '.