Is there any proof that says "For each problem in NP there is a randomized algorithm that solves that problem in expected polynomial time."

Is it known that "For each problem in NP there is a randomized algorithm that solves it in polynomial time"? If not true then is there any proof of that. Or does it belongs to the unknown domain?