On the Reduction Theory for Average Case Complexity

13 years 8 months ago

Download research.microsoft.com

This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.

Andreas Blass, Yuri Gurevich

Real-time Traffic

Automated Reasoning | CSL 1990 | Deterministicand Randomized Reductions | Randomized |

claim paper

» Structural Average Case Complexity

» Pseudorandomness and AverageCase Complexity Via Uniform Reductions

» Randomizing Reductions of Search Problems

» WorstCase to AverageCase Reductions Revisited

» The Lattice Reduction Algorithm of Gauss An Average Case Analysis

» On WorstCase to AverageCase Reductions for NP Problems

» AverageCase Complexity of Shellsort

» How robust are average complexity measures A statistical case study

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1990
Where	CSL
Authors	Andreas Blass, Yuri Gurevich

Comments (0)

Sciweavers

On the Reduction Theory for Average Case Complexity

Automated Reasoning | CSL 1990 | Deterministicand Randomized Reductions | Randomized |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers