Random self-reducibility

http://dbpedia.org/resource/Random_self-reducibility an entity of type: Country

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. rdf:langString

rdfs:label

rdf:langString Random self-reducibility

dbpedia-owl:wikiPageID

xsd:integer 3087266

dbpedia-owl:wikiPageRevisionID

xsd:integer 859390116

dbpedia-owl:abstract

rdf:langString 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.

dbpedia-owl:wikiPageLength

xsd:nonNegativeInteger 6563

rdf:type

dbpedia-owl:Country

dcterms:subject

<http://dbpedia.org/resource/Category:Randomized_algorithms>

dbpedia-owl:wikiPageWikiLink

<http://dbpedia.org/resource/Category:Randomized_algorithms>

<http://dbpedia.org/resource/Permanent_is_sharp-P-complete>

<http://dbpedia.org/resource/Cryptography>

<http://dbpedia.org/resource/One-time_pad>

<http://dbpedia.org/resource/Function_(computer_science)>