Skip to search formSkip to main contentSkip to account menu

Random self-reducibility

Known as: Random self-reducible 
Random self-reducibility (RSR) is the rule that a good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions… 
Highly Cited
2012
Highly Cited
2012
Highly Cited
2011
Highly Cited
2011
Abstract In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural… 
Highly Cited
2010
Highly Cited
2010
  • Craig Gentry
  • Annual International Cryptology Conference
  • 2010
  • Corpus ID: 16326013
Gentry proposed a fully homomorphic public key encryption scheme that uses ideal lattices. He based the security of his scheme on… 
2007
2007
We show that a family of tree languages W$_{(l,k)}$, previously used by J. Bradfield, and by the first author to show the… 
Highly Cited
2003
Highly Cited
2003
AbstractTwo natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those… 
Highly Cited
2001
Highly Cited
2001
1995
1995
In this note, we study NP-selective sets (formally, sets that are selective via NPSVt functions) as a natural generalization of P… 
Highly Cited
1989
Highly Cited
1989
In this paper, a new class of zero knowledge interactive proofs, a divertible zero knowledge interactive proof, is presented… 
Highly Cited
1987
Highly Cited
1987
  • M. TompaH. Woll
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
  • Corpus ID: 14500783
The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any…