Report on Generic Case Complexity
Computational Complexity
2007-07-11 v1
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.
Keywords
Cite
@article{arxiv.0707.1364,
title = {Report on Generic Case Complexity},
author = {Robert Gilman and Alexei G. Miasnikov and Alexey D. Myasnikov and Alexander Ushakov},
journal= {arXiv preprint arXiv:0707.1364},
year = {2007}
}
Comments
17 pages