Skip to search formSkip to main contentSkip to account menu

Average-case complexity

Known as: Average case complexity, Average case computational complexity, Expected time 
In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In order to seamlessly integrate a human computation component (e.g., Amazon Mechanical Turk) within a larger production system… 
Highly Cited
2004
Highly Cited
2004
We consider broadcasting in radio networks, modeled as undirected graphs, whose nodes know only their own label and labels of… 
Highly Cited
2004
Highly Cited
2004
In this paper, a set of multiuser access schemes are proposed based on switched diversity algorithms originally devised to select… 
2003
2003
In this paper, we propose a time‐based channel reservation algorithm (TCRA) suitable for handover and call admission control… 
1994
1994
  • Samir W. Mahfoud
  • 1994
  • Corpus ID: 8136426
Adding a sharing method to a genetic algorithm promotes the formation and maintenance of stable subpopulations. The paper… 
Highly Cited
1993
1993
1993
SummaryThe addition of frequency dependence to the marginal value theorem (MVT) model of the dung fly (Scatophaga stercoraria… 
1990
1990
A general approach to hardware recognition is proposed for VLSI/WSI fault-tolerant processor arrays. The technique, called full… 
Highly Cited
1984
Highly Cited
1984
Seismic hazard analyses are associated with large uncertainties when historical data are insufficient to define secular rates of…