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

Topic mentions per year

Topic mentions per year

1974-2016
02419742016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that… (More)
  • table 1
Is this relevant?
2015
2015
In this work, we define a new notion of weakly Random-Self-Reducibile cryptosystems and show how it can be used to implement… (More)
Is this relevant?
2013
2013
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions… (More)
Is this relevant?
2004
2004
Let l be the number of edges in a longest cycle containing a given vertex v in an undirected graph. We show how to find a cycle… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
1998
1998
We introduce two special kinds of self-reducible sets that we call time-graded and spacegraded languages. Attaching time and… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We introduce and study resource bounded random sets based on Lutz's concept of resource bounded measure ((7, 8]). We concentrate… (More)
Is this relevant?
1989
1989
In this paper, a new class of zero knowledge interactive proofs, a divertible zero knowledge interactive proof, is presented… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any… (More)
Is this relevant?
1986
1986
A set A not in P is polynomially levelable if any algorithm for A has speedup to a polynomial infinitely often in A: precisely… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
 
Is this relevant?