Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
Highly Cited
2012
Highly Cited
2012
Abstract We study closed choice principles for different spaces. Given information about what does not constitute a solution… Expand
  • figure 1
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… Expand
2004
2004
We study reducibilities that act as measures of relative randomness on reals, concentrating particularly on their behavior on the… Expand
Highly Cited
2003
Highly Cited
2003
AbstractTwo natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those… Expand
  • table 1
Highly Cited
2000
Highly Cited
2000
For two years, public key encryption has become an essential topic in cryptography, namely with security against chosen… Expand
  • figure 1
  • figure 2
  • figure 4
Highly Cited
1995
Highly Cited
1995
Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. We exploit the additional fact that SAT is a d… Expand
1995
1995
In this note, we study NP-selective sets (formally, sets that are selective via NPSVt functions) as a natural generalization of P… Expand
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… Expand
Highly Cited
1987
Highly Cited
1987
  • M. Tompa, H. 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… Expand