Home Mathematics Musings on generic-case complexity
Chapter
Licensed
Unlicensed Requires Authentication

Musings on generic-case complexity

  • Ilya Kapovich
Become an author with De Gruyter Brill

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.

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.

Downloaded on 1.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9783110638387-014/html
Scroll to top button