On the Reduction Theory for Average Case Complexity

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.

• Type: Conference
• Year: 1990
• Where: CSL
• Authors: Andreas Blass, Yuri Gurevich
• Keywords: Automated Reasoning, CSL 1990, Deterministicand Randomized Reductions, Randomized