Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,842,912 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
Algorithm
Best, worst and average case
Boyer–Moore–Horspool algorithm
Bubble sort
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Multiuser switched diversity transmission
B. Holter
,
Mohamed-Slim Alouini
,
G. Oien
,
Hong-Chuan Yang
IEEE 60th Vehicular Technology Conference, . VTC…
2004
Corpus ID: 40164230
In this paper, a set of multiuser access schemes are proposed based on switched diversity algorithms originally devised to select…
Expand
2002
2002
The Special Function Field Sieve
Oliver Schirokauer
SIAM Journal on Discrete Mathematics
2002
Corpus ID: 43454993
Let p be a prime number and n a positive integer, and let q=pn. Adleman and Huang [Inform. and Comput., 151 (1999), pp. 5--16…
Expand
1999
1999
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms
D. Avis
,
B. Beresford-Smith
,
+4 authors
B. Zhu
SIAM journal on computing (Print)
1999
Corpus ID: 9409152
We introduce the unoriented $\Theta$-maximum as a new criterion for describing the shape of a set of planar points. We present…
Expand
1999
1999
Performance Evaluation of Control Networks : Ethernet ,
Feng‐Li Lian
,
J. Moyne
,
D. Tilbury
1999
Corpus ID: 18131346
1 Introduction The traditional communication architecture for control systems is point-to-point, which has been successfully…
Expand
1997
1997
Average case computational complexity theory
T. Yamakami
1997
Corpus ID: 124748483
The hardest problems in the complexity class NP are called NP-complete. However, not all NP-complete problems are equally hard to…
Expand
1994
1994
Genetic drift in sharing methods
Samir W. Mahfoud
Proceedings of the First IEEE Conference on…
1994
Corpus ID: 8136426
Adding a sharing method to a genetic algorithm promotes the formation and maintenance of stable subpopulations. The paper…
Expand
1991
1991
Fast hashing on a PRAM—designing by expectation
Joseph Gil
,
Yossi Matias
ACM-SIAM Symposium on Discrete Algorithms
1991
Corpus ID: 14897964
A hash table is a data structure for representing a set of n items that uses linear space and supports membership queries in O(1…
Expand
1986
1986
Storing a dynamic sparse table
A. Aho
,
David Lee
27th Annual Symposium on Foundations of Computer…
1986
Corpus ID: 417354
We present a family of data structures that can process a sequence of insert, delete, and lookup instructions such that each…
Expand
1984
1984
A constant expected time, linear storage data structure for representing three-dimensional objects
T. Woo
,
J. Wolter
IEEE Transactions on Systems, Man and Cybernetics
1984
Corpus ID: 2960742
The interrogation of spatial relations and properties of three-dimensional objects are often involved in applications programs…
Expand
1966
1966
Reliability Considerations for a Two Element Redundant System with Generalized Repair Times
B. Liebowitz
Operational Research
1966
Corpus ID: 32685590
The mean time to failure for a two element, redundant repairable system is derived. The system consists of identical elements…
Expand