Musings on generic-case complexity
classification
💻 cs.CC
math.GRmath.LO
keywords
complexitygeneric-caseinputalgorithmdefinitiongeneralgenerategenerating
read the original abstract
We propose a more general definition of generic-case complexity, based on using a random process for generating inputs of an algorithm and using the time needed to generate an input as a way of measuring the size of that input.
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.