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.
From Wikipedia, the free encyclopedia 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. If for a function f evaluating any instance x can be reduced in polynomial time to the evaluation of f on one or more random instances yi, then it is self-reducible (this is also known as a non-adaptive uniform self-reduction). In a random self-reduction, an arbitrary worst-case instance x in the domain of f is mapped to a…
saved by
related reading
- Random forest - Wikipediaen.wikipedia.org
- P versus NP problem - Wikipediaen.wikipedia.org
- Complexity class - Wikipediaen.wikipedia.org
- Pseudorandom permutation - Wikipediaen.wikipedia.org
- 2010.03585arxiv.org
- ants.dvicrypto.stanford.edu
- random matrices.dviwww-math.mit.edu
- No free lunch in search and optimizationen.wikipedia.org
- CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
- Arborescences of Random Covering Graphsarxiv.org
- 2e9f9cde1b709281a06dd14f679e4c51-Paper-Conference.pdfproceedings.neurips.cc
- Private information retrieval using homomorphic encryption (explained from scratch)blintzbase.com