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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In this paper, we present a dependency treebased method for sentiment classification of Japanese and English subjective sentences… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Any proof of P!=NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen… (More)
Is this relevant?
Review
2007
Review
2007
Neurons in the dorsomedial hypothalamus (DMH) play key roles in physiological responses to exteroceptive ("emotional") stress in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The authors advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present a randomized polynomial time algorithm to determine if a multivariate polynomial is zero using <italic>O(\log mn… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Bartal [4, 5] gave a randomized polynomial time algorithm that given anyn point metricG, constructs a treeT such that the… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Newly synthesized histone H4 is deposited in a diacetylated isoform in a wide variety of organisms. In Tetrahymena a specific… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Hash-based scalable distributed data structures (SDDSs), like LH* and DDH, for networks of interconnected computers… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
This paper describes the implementation of both Point of Collapse (PoC) methods and continuation methods for the computation of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We show that the problem of counting the number of linear extensions of a given partially ordered set is #P-complete. This… (More)
  • figure 2
  • figure 1
Is this relevant?