Report on Generic Case Complexity

Simple item page
dc.creatorGilman, Robert
dc.creatorMiasnikov, Alexei G.
dc.creatorMyasnikov, Alexey D.
dc.creatorUshakov, Alexander
dc.date2007-07-10
dc.date.accessioned2026-07-07T08:14:48Z
dc.date.available2026-07-07T08:14:48Z
dc.descriptionThis 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.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/0707.1364
dc.identifierhttp://arxiv.org/abs/0707.1364
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133261
dc.subjectComputational Complexity
dc.subjectF.1.3
dc.titleReport on Generic Case Complexity
dc.typetext

Files

Collections

arXiv