Skip to search formSkip to main contentSkip to account menu

Time complexity

Known as: N log n, Polynomial-time solutions, Cubic time 
In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2011
Review
2011
In wavelength-switched optical networks (WSONs), quality of transmission (QoT) has to be guaranteed during lightpath provisioning… 
Highly Cited
2010
Highly Cited
2010
Extreme learning machines are fast models which almost compare to standard SVMs in terms of accuracy, but are much faster… 
Highly Cited
2007
Highly Cited
2007
As a result of CMOS scaling, the critical dimension (CD) of integrated circuits has been shrinking. At sub-45 nm nodes, in which… 
Highly Cited
2003
Highly Cited
2003
Transform coding has been widely used in video coding standards. In this paper, a hardware architecture for accelerating… 
Highly Cited
1985
Highly Cited
1985
  • R. Lathrop
  • 1985
  • Corpus ID: 19322273
This paper addresses the problem of efficiently computing the motor torques required to drive a manipulator arm in free motion… 
Highly Cited
1978
Highly Cited
1978
Very rapid initial convergence of the equalizer tap coefficients is a requirement of many data communication systems which employ… 
Highly Cited
1971
Highly Cited
1971
The traveling-salesman problem has been the target of a substantial number of computational algorithms over the last two decades…