Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,400,059 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Average-case complexity
Best, worst and average case
Computing the permanent
Cryptography
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data
Brynmor Chapman
,
Ryan Williams
Information Technology Convergence and Services
2015
Corpus ID: 14139897
We revisit a natural zero-sum game from several prior works. A circuit player, armed with a collection of Boolean circuits, wants…
Expand
2014
2014
Energy Efficient Recycling of in-Plant Fines
H. Ahmed
,
A. Persson
,
L. Sundqvist
,
B. Biorkman
2014
Corpus ID: 34649718
—Numerous amounts of metallurgical dusts and sludge containing iron as well as some other valuable elements such as Zn, Pb and C…
Expand
2008
2008
INTO P s DENSELY
J. Cole
2008
Corpus ID: 16176722
Let Ps be the lattice of degrees of non-empty Π01 subsets of 2 ω under Medvedev reducibility. Binns and Simpson proved that FD…
Expand
1997
1997
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable
S. Vorobyov
International Conference on Rewriting Techniques…
1997
Corpus ID: 7892043
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one step rewriting.
1995
1995
Some Results on Selectivity and Self-Reducibility
Jie Wang
Information Processing Letters
1995
Corpus ID: 29963564
1994
1994
Selectivity and Self-reducibility: New Characterizations of Complexity Classes
Jie Wang
1994
Corpus ID: 15973941
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…
Expand
1991
1991
Constructive complexity
Karl R. Abrahamson
,
M. Fellows
,
M. Langston
,
B. Moret
Discrete Applied Mathematics
1991
Corpus ID: 8187716
1990
1990
A result relating disjunctive self-reducibility to P-immunity
J. Käper
1990
Corpus ID: 123345641
1986
1986
Optimal Approximations and Polynomially Levelable Sets
P. Orponen
,
David A. Russo
,
U. Schöning
SIAM journal on computing (Print)
1986
Corpus ID: 5441808
A set A not in P is polynomially levelable if any algorithm for A has speedup to a polynomial infinitely often in A: precisely…
Expand
1984
1984
Monotone reducibility and the family of infinite sets
D. Cenzer
Journal of Symbolic Logic (JSL)
1984
Corpus ID: 37813340
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE