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
Parents
3
A personal view of average-case complexity
Russell Impagliazzo · 2002 · 298 citations
Andrej Bogdanov, Luca Trevisan · Foundations and Trends® in Theoretical Computer Science · 2006 · 120 citations
Luca Trevisan · 2008 · 15 citations
1–3 of 3
3
2
h-index
1
h-index
1
h-index
1–3 of 3
6
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
135 citations
Rutgers Sexual and Reproductive Health and Rights
Utrecht, Netherlands
1 h-index
1 publications
120 citations
University of California San Diego
San Diego, United States
1 h-index
1 publications
298 citations
Center for Discrete Mathematics and Theoretical Computer Science
Piscataway, United States
1 h-index
1 publications
120 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
120 citations
Berkeley College
New York, United States
1 h-index
1 publications
120 citations
1–6 of 6
1 publications · 120 citations
1
h-index
1–1