Random Self-Reducibility

by Betascript Publishing
State: New
VAT included - FREE Shipping
Betascript Publishing Random Self-Reducibility
Betascript Publishing - Random Self-Reducibility

Do you like this product? Spread the word!

$33.44 incl. VAT
Only 1 items available Only 1 items available
Delivery: between Wednesday, June 1, 2022 and Friday, June 3, 2022
Sales & Shipping: Dodax


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Random self-reducibility (RSR): 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 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 random set of instances y1, ..., yk. This is done so that f(x) can be computed in polynomial time, given the coin-toss sequence from the mapping, x, and f(y1), ..., f(yk). Therefore, taking the average with respect to the induced distribution on yi, the average-case complexity of f is the same (within polynomial factors) as the worst-case randomized complexity of f.

Further information

Number of Pages:
Surhone, Lambert M.
Tennoe, Mariam T.
Henssonow, Susan F.
Media Type:
Betascript Publishing

Master Data

Product Type:
Paperback book
Package Dimensions:
0.23 x 0.15 x 0.01 m; 0.145 kg
We use cookies on our website to make our services more efficient and more user-friendly. Therefore please select "Accept cookies"! Please read our Privacy Policy for further information.