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
2009
Highly Cited
2009
Abstract Parsimony analysis of plastid rpl16 sequences from 62 members of Tribe Cacteae, and four outgroup taxa yielded 1296… 
Highly Cited
2007
Highly Cited
2007
Research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable… 
Highly Cited
2004
Highly Cited
2004
In-band crosstalk has been widely considered as a major transmission impairment that significantly impacts the BER (bit error… 
Highly Cited
2004
Highly Cited
2004
Many biological materials (e.g. wood, cork, bone, etc) are based on cellular designs, since cellular architectures offer the… 
Highly Cited
2003
Highly Cited
2003
Highly Cited
1999
Highly Cited
1999
Information about the ecological components of Alaska's Prince William Sound (PWS) has increased considerably since the 1989… 
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
1994
Highly Cited
1994
We examined two recently developed measures of positive automatic thought, the Positive Automatic Thoughts Questionnaire (ATQ-P… 
Highly Cited
1990
Highly Cited
1990
Cereal Chern. 67(2):129-135 Rice varietal identification is important for breeding new varieties and for marketing varieties for…