Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,696,296 papers from all fields of science
Search
Sign In
Create Free Account
Time complexity
Known as:
N log n
, Polynomial-time solutions
, Cubic time
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AKS primality test
Abstract machine
Adaptive sort
Adleman–Pomerance–Rumely primality test
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Scalable RFID security protocols supporting tag ownership transfer
Boyeon Song
,
C. Mitchell
Computer Communications
2011
Corpus ID: 825171
Highly Cited
2009
Highly Cited
2009
Selecting highly optimal architectural feature sets with Filtered Cartesian Flattening
Jules White
,
Brian Dougherty
,
D. Schmidt
Journal of Systems and Software
2009
Corpus ID: 18741278
Highly Cited
2007
Highly Cited
2007
Shortcut Tree Routing in ZigBee Networks
Taehong Kim
,
Daeyoung Kim
,
Noseong Park
,
Seong-eun Yoo
,
T. López
International Symposium on Wireless Pervasive…
2007
Corpus ID: 9595553
ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. Due to characteristics such as low data…
Expand
Highly Cited
2007
Highly Cited
2007
Impact of Line-Edge Roughness on FinFET Matching Performance
E. Baravelli
,
Abhisek Dixit
,
R. Rooyackers
,
Malgorzata Jurczak
,
Nicolò Speciale
,
K. D. Meyer
IEEE Transactions on Electron Devices
2007
Corpus ID: 25864162
As a result of CMOS scaling, the critical dimension (CD) of integrated circuits has been shrinking. At sub-45 nm nodes, in which…
Expand
Highly Cited
2002
Highly Cited
2002
Analysis of incorporating logistic testing-effort function into software reliability modeling
Chin-Yu Huang
,
S. Kuo
IEEE Transactions on Reliability
2002
Corpus ID: 18775774
This paper investigates a SRGM (software reliability growth model) based on the NHPP (nonhomogeneous Poisson process) which…
Expand
Highly Cited
2000
Highly Cited
2000
On a decomposition of multivariable forms via LMI methods
P. Parrilo
Proceedings of the American Control Conference…
2000
Corpus ID: 63205210
In this paper, it is shown that some of the convenient characteristics of LMI-based methods can be extended to a class of…
Expand
Highly Cited
1998
Highly Cited
1998
Adaptive batch monitoring using hierarchical PCA
S. Rännar
,
J. Macgregor
,
S. Wold
1998
Corpus ID: 62675380
Highly Cited
1993
Highly Cited
1993
Joint signal detection and parameter estimation in multiuser communications
Zhenhua Xie
,
C. Rushforth
,
R. Short
,
T. Moon
IEEE Transactions on Communications
1993
Corpus ID: 6089372
The problem of simultaneously detecting the information bits and estimating signal amplitudes and phases in a K-user asynchronous…
Expand
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…
Expand
Highly Cited
1978
Highly Cited
1978
Application of Fast Kalman Estimation to Adaptive Equalization
D. Falconer
,
L. Ljung
IEEE Transactions on Communications
1978
Corpus ID: 62371011
Very rapid initial convergence of the equalizer tap coefficients is a requirement of many data communication systems which employ…
Expand
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)
ACCEPT & CONTINUE