# RP (complexity)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- HLT-NAACL
- 2010

In this paper, we present a dependency treebased method for sentiment classification of Japanese and English subjective sentencesâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- STOC
- 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

- American journal of physiology. Regulatoryâ€¦
- 2007

Neurons in the dorsomedial hypothalamus (DMH) play key roles in physiological responses to exteroceptive ("emotional") stress inâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

The authors advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving twoâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- STOC
- 2001

We present a randomized polynomial time algorithm to determine if a multivariate polynomial is zero using <italic>O(\log mnâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- FOCS
- 1998

Bartal [4, 5] gave a randomized polynomial time algorithm that given anyn point metricG, constructs a treeT such that theâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Proceedings of the National Academy of Sciencesâ€¦
- 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

- VLDB
- 1994

Hash-based scalable distributed data structures (SDDSs), like LH* and DDH, for networks of interconnected computersâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- 1993

This paper describes the implementation of both Point of Collapse (PoC) methods and continuation methods for the computation ofâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- STOC
- 1991

We show that the problem of counting the number of linear extensions of a given partially ordered set is #P-complete. Thisâ€¦Â (More)

Is this relevant?