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.
2015
2015
We revisit a natural zero-sum game from several prior works. A circuit player, armed with a collection of Boolean circuits, wants… 
2014
2014
—Numerous amounts of metallurgical dusts and sludge containing iron as well as some other valuable elements such as Zn, Pb and C… 
2008
2008
Let Ps be the lattice of degrees of non-empty Π01 subsets of 2 ω under Medvedev reducibility. Binns and Simpson proved that FD… 
1997
1997
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one step rewriting. 
1994
1994
It is known that a set is in P ii it is p-time Turing self-reducible and p-selective 2] and a p-time Turing self-reducible set is… 
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… 
1984
1984
Abstract Let A and B be subsets of the space 2N of sets of natural numbers. A is said to be Wadge reducible to B if there is a…