Report on Generic Case Complexity
classification
💻 cs.CC
keywords
casecomplexitygenericrecursivelyappliesarticleatypicalbehavior
read the original abstract
This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of a computational problem while ignoring atypical behavior on a small set of inputs. Generic case complexity applies to both recursively solvable and recursively unsolvable problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.