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.
2006
2006
Random packet CDMA, a novel packet-based multiple access scheme for connectionless, uncoordinated random channel access is… 
2005
2005
In rapid prototyping, the optimal part orientation during fabrication is critical as it can improve part accuracy, minimize the… 
2004
2004
Intrusion detection has emerged as an important approach to security problems. The existing techniques are analyzed, and then an… 
2003
2003
A rapid assay procedure based on RP-HPLC has been developed for the simultaneous determination of metformin and glimepiride in… 
1999
1999
Par sa presentation radio-clinique, le rhumatisme psoriasique (RP) est certainement le plus mal compris et donc le plus… 
1998
1998
The work presented in this paper was initiated as part of a study on software alternatives to the hardware implementations of… 
1996
1996
Cereal Chem. 73(6):775-778 Near-infrared reflection (NIR) spectroscopy may be used to estimate hardness based on NITlH and NIT2H… 
1995
1995
The objective of this study was to investigate pollution prevention (P2) opportunities in the textile wet processing industry… 
1975
1975
A random phase approximation (RPA) calculation and a direct sum over states is used to calculate second−order optical properties…