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)

Related topics

Related topics

49 relations
AKS primality testAbstract machineAdaptive sortAdleman–Pomerance–Rumely primality test

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Cooperative Communications in Multi-hop Wireless Networks: Joint Flow Routing and Relay Node Assignment
It has been shown that cooperative communications (CC) have the potential to significantly increase the capacity of wireless… 
Highly Cited
2007
Highly Cited
2007
Impact of Line-Edge Roughness on FinFET Matching Performance
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
2006
Highly Cited
2006
Erratum to: "Computation of deformation induced by earthquakes in a multi-layered elastic crust - FORTRAN programs EDGRN/EDCMP": [Computers & Geosciences, 29(2) (2003) 195-207]
Review
2003
Review
2003
Electronics Below 10 nm
Highly Cited
2003
Highly Cited
2003
Parallel 4/spl times/4 2D transform and inverse transform architecture for MPEG-4 AVC/H.264
Transform coding has been widely used in video coding standards. In this paper, a hardware architecture for accelerating… 
Highly Cited
2003
Highly Cited
2003
Electron trapping, storing, and emission in nanocrystalline Si dots by capacitance–voltage and conductance–voltage measurements
Temperature and frequency dependent electrical properties of SiO2/nanocrystalline Si (nc-Si)/SiO2 sandwich structures have been… 
Highly Cited
1994
Highly Cited
1994
A weighted fuzzy reasoning algorithm for medical diagnosis
Highly Cited
1985
Highly Cited
1985
Parallelism in Manipulator Dynamics
  • R. Lathrop
  • Proceedings. IEEE International Conference on…
  • 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
Application of Fast Kalman Estimation to Adaptive Equalization
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
Pathology of Traveling-Salesman Subtour-Elimination Algorithms
The traveling-salesman problem has been the target of a substantial number of computational algorithms over the last two decades… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)