s/garden
1
1
Fork 0
Code Issues Pull requests Releases Wiki Activity

add some cryptography stuff

Browse source
This commit is contained in:
Aly 2025-09-12 09:16:05 -06:00
parent 3bc9811e25
commit c0c42524de
7 changed files with 30 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

5
probabilistic-polynomial-time.md Normal file
View file

@ -0,0 +1,5 @@
# Probabilistic Polynomial Time
- for a given problem, a PPT algorithm for the problem runs in P-time, with a high (likely non-one) probability of giving the correct answer
- takes randomness as an input
- impossible to guarantee the real solution without running the algorithm on all possible randomness (NP)