NP-hardness and NP-completeness play an important role in complexity theory. My question is, does there exist a language $L$ in RP to which any language $M$ in RP can be reduced in polynomial time?We can say that such a language $L$ is RP-complete, if exists, but I cannot find any information about this idea. Can anyone tell me about it, please?
Does there exist the idea of RP-complete, like NP-complete?
cc.complexity theory;np hardness