In computer - complexity theory , randomized polynomial time ( RP ) is the complexity class of problems for which a probabilistic turing machine exists with these characteristics :
In computational complexity theory , randomized polynomial time ( RP ) is the complexity class of problems for which a probabilistic Turing machine exists with these properties :