Skip to search formSkip to main contentSkip to account menu

RP (complexity)

Known as: Co-RP, Rp, Randomized polynomial time 
In computational complexity theory, randomized polynomial time (RP) is the complexity class of problems for which a probabilistic Turing machine… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2003
Highly Cited
2003
Soybean [Glycine max (L.) Merr.] seed protein is negatively correlated with seed oil and often with yield. Our goal was to… 
Highly Cited
2002
Highly Cited
2002
Scaffolds are of great importance for tissue engineering because they enable the production of functional living implants out of… 
Highly Cited
2001
Highly Cited
2001
Abstract Most empirical models of choice in economics and consumer research assume that the decision maker assesses all… 
Highly Cited
1999
Highly Cited
1995
Highly Cited
1995
An introduction to the nomenclature and usage of the reaction path concept D. Heidrich. From reaction path to reaction mechanism… 
Highly Cited
1990
Highly Cited
1990
The "Longman Pronunciation Dictionary" is designed to reflect English as it is spoken. In the introduction, the author discusses…