Musings on generic-case complexity
Computational Complexity
2015-05-14 v1 Group Theory
Logic
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.
Keywords
Cite
@article{arxiv.1505.03218,
title = {Musings on generic-case complexity},
author = {Ilya Kapovich},
journal= {arXiv preprint arXiv:1505.03218},
year = {2015}
}
Comments
9 pages, no figures