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.
Highly Cited
2015
Highly Cited
2015
In this research work, an eight-term 3-D novel chaotic system with an exponential nonlinearity has been derived. The basic… 
Highly Cited
2010
Highly Cited
2010
In recent years, more and more automobile producers adopted the supermarketconcept to enable a exible and reliable Just-in-Time… 
Highly Cited
2007
Highly Cited
2007
Numerical grid and time-step-dependencies of Discrete Droplet Lagrangian spray models are identified. The two main sources of… 
Highly Cited
2007
Highly Cited
2007
In this paper, we present a fast mode decision algorithm and design its VLSI architecture for H.264 intra-prediction. A regular… 
Review
2003
Review
2003
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
Multirate sampled-data control of a linear time-invariant continuous-time plant is considered. It is shown that, if the plant is… 
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
1980
Highly Cited
1980
Empirical observations are used to derive analytic formulae for test volumes, parallel fault simulation costs, deductive fault… 
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…