📚 node [[probabilistic polynomial time]]
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)
📖 stoas
- public document at doc.anagora.org/probabilistic-polynomial-time
- video call at meet.jit.si/probabilistic-polynomial-time
⥱ context
← back
(none)
(none)
↑ pushing here
(none)
(none)
↓ pulling this
(none)
(none)
→ forward
(none)
(none)
🔎 full text search for 'probabilistic polynomial time'