Musings on generic-case complexity

13 May 2015 Kapovich Ilya

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...

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY
  • GROUP THEORY
  • LOGIC