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 tree-based method for sentiment classification of Japanese and English subjective… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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?
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
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)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
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
The implementation of both point of collapse (PoC) methods and continuation methods for the computation of voltage collapse… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Pseudorandom generators are constructed which convertO(SlogR) truly random bits toR bits that appear random to any algorithm that… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Abadi, Feigenbaum, and Kilian have considered instance-hiding schemes [1]. Let f be a function for which no randomized polynomial… (More)
Is this relevant?
Highly Cited
1962
Highly Cited
1962
Revised to cover modern instrumental techniques, recent research and publications, current terminology, and changes in present… (More)
Is this relevant?