Sujet : Re: ℙ≠ℕℙ proof
De : news (at) *nospam* immibis.com (immibis)
Groupes : comp.theoryDate : 19. May 2024, 03:21:31
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v2bnnb$368ti$1@dont-email.me>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 18/05/24 14:18, wij wrote:
On Sat, 2024-05-18 at 12:36 +0200, immibis wrote:
On 18/05/24 12:10, wij wrote:
If no more information of the
key is given, the computation of key_exist(..) can only be done by
visiting each one of O(2^|ctext|) possibilies of the key.
>
prove it
You cut off the relevant phrase. "Every key has to be visited", though phrased differently
prove that every key has to be visited
ℙ≠ℕℙ proof
Re: ℙ≠ℕℙ proof