Average-ase Complexity

Average-Ase Complexity is a theoretical construct in algorithmic complexity that characterizes the expected computational cost of an algorithm over all possible inputs of a given size, assuming a uniform probability distribution, thereby distinguishing itself from worst-case and best-case complexity measures by focusing on average-case performance under standard input assumptions.

3

Publications

433

Citations

3

Authors

6

Institutions

Publications per year

2017–2026

0

Authors

3

  1. LT
    Luca Trevisan

    University of California, Berkeley, United States

    2 publications · 135 citations

    2

    h-index

  2. AB
    Andrej Bogdanov

    Chinese University of Hong Kong, Hong Kong SAR China

    1 publications · 120 citations

    1

    h-index

  3. RI
    Russell Impagliazzo

    University of California San Diego, United States

    1 publications · 298 citations

    1

    h-index

1–3 of 3

Venues

  1. 1

    h-index

1–1