CSL 1991
On the Reduction Theory for Average Case Complexity
Abstract
Abstract This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an attempt to derive these notions from (more or less) first principles.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- Annual Conference on Computer Science Logic
- Archive span
- 1988-2026
- Indexed papers
- 1413
- Paper id
- 68515957060595604