Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,718,978 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.
2017
2017
Weihrauch Reducibility and Finite-Dimensional Subspaces
Sean Sovine
2017
Corpus ID: 125623033
In this thesis we study several principles involving subspaces and decompositions of vector spaces, matroids, and graphs from the…
Expand
2016
2016
On Self-Reducibility and Reoptimization of Closest Substring Problem
Jeffrey A. Aborot
,
H. Adorna
,
Jhoirene B. Clemente
arXiv.org
2016
Corpus ID: 2289963
In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that…
Expand
2015
2015
Some properties of r-maximal sets and Q1,N-reducibility
R. Omanadze
Archive for Mathematical Logic
2015
Corpus ID: 253674134
We show that the c.e. Q1,N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts…
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
2007
2007
Notes on Self-reducibility of the Weil representation and quantum chaos
S. Gurevich
,
R. Hadani
2007
Corpus ID: 18337788
In these notes we discuss the self-reducibility property of the Weil representation. We explain how to use this property to…
Expand
2007
2007
Graded Self-Reducibility Mitsunori Ogihara
W. Regan
,
Seinosuke Toda
2007
Corpus ID: 17886745
We introduce two special kinds of self-reducible sets that we call time-graded and space-graded languages. Attaching time and…
Expand
2005
2005
Self-Reducibility of Hard Counting Problems with Decision Version in P
Aris Pagourtzis
,
S. Zachos
2005
Corpus ID: 18932916
Many NP-complete problems have counting versions which are #P-complete. On the other hand, #Perfect Matchings is also Cook…
Expand
1996
1996
A Note on a Variant of Immunity, Btt-reducibility, and Minimal Indices Extended Abstract
Stephen A. Fenner
,
Marcus Schaefery
1996
Corpus ID: 18820008
We deene and study a new notion called k-immunity that lies between immunity and hyper immunity in strength. Our interest in k…
Expand
1994
1994
On Self-Reducible Sets of Low Information Content
M. Mundhenk
International/Italian Conference on Algorithms…
1994
Corpus ID: 31008115
Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way…
Expand
Review
1989
Review
1989
Nondeterministic Witnesses and Nonuniform Advice
L. Balcbar
1989
Corpus ID: 54089590
We survey several results related to non- uniform complexity classes and their comparison with uni- form ones. The relevance of…
Expand