Live briefing
Everything about Random self-reducibility
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 to solve all instances of a problem by solving a large fraction of the instances. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Random self-reducibilityA 5-minute orientation
- Pick up a classic book: Objects first with JavaThe most-reprinted book on the subject
- Read the landmark paper: Random-Self-Reducibility of Complete SetsCited 105 times
- Go sideways: Discrete logarithmA closely related topic
- Go sideways: One-way functionA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Objects first with JavaDavid J. Barnes, Michael Kolling · 2002
The Conspirators HierarchyJohn Coleman · 1992
Principles of Distributed SystemsRoberto Baldoni · 2012
Practical Electronics for InventorsPaul Scherz · 2000
NanosystemsK. Eric Drexler · 1992
Principles of gene manipulation and genomicsS. B. Primrose · 2006
Introduction to the theory of computationMichael Sipser · 1996
Information Security ApplicationsDong Hoon Lee · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Discrete logarithm In mathematics, for given real numbers a and b, the logarithm logb(a) is a number x such that bx=a. The discrete logarithm is an analogous concept in group…
- One-way function Unsolved problem in computer science Do one-way functions exist? More unsolved problems in computer science In computer science, a one-way function is…
- Homomorphic signatures for network coding Network coding has been shown to optimally use bandwidth in a network, maximizing information flow but the scheme is very inherently vulnerable to pollution…
- Ring learning with errors signature Digital signatures are a means to protect digital information from intentional modification and to authenticate the source of digital information. Public…
- Short integer solution problem Short integer solution (SIS) and ring-SIS problems are two average-case problems that are used in lattice-based cryptography constructions. Lattice-based…
- Computing the permanent In linear algebra, the computation of the permanent of a matrix is a problem that is thought to be more difficult than the computation of the determinant…
- Ring learning with errors In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms…
- Commitment scheme A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others, with…