Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,130,289 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
2015
Highly Cited
2015
Hyperchaos, qualitative analysis, control and synchronisation of a ten-term 4-D hyperchaotic system with an exponential nonlinearity and three quadratic nonlinearities
S. Vaidyanathan
International journal of Modeling, identification…
2015
Corpus ID: 44268737
In this research work, a ten-term novel hyperchaotic system with an exponential nonlinearity and three quadratic nonlinearities…
Expand
Review
2013
Review
2013
Intelligent Web Crawling
Denis Shestakov
The IEEE intelligent informatics bulletin
2013
Corpus ID: 11326025
—Web crawling, a process of collecting web pages in an automated manner, is the primary and ubiquitous operation used by a large…
Expand
Highly Cited
2011
Highly Cited
2011
Getting the Most out of Transition-based Dependency Parsing
Jinho D. Choi
,
Martha Palmer
Annual Meeting of the Association for…
2011
Corpus ID: 6489831
This paper suggests two ways of improving transition-based, non-projective dependency parsing. First, we add a transition to an…
Expand
Highly Cited
2005
Highly Cited
2005
Novel pixel architecture with inherent background suppression for 3D time-of-flight imaging
T. Oggier
,
R. Kaufmann
,
+7 authors
N. Blanc
2005
Corpus ID: 121819064
The time-of-flight (TOF) principle is a well known principle to acquire a scene in all three dimensions. The advantages of the…
Expand
Highly Cited
2001
Highly Cited
2001
A short-open deembedding technique for method-of-moments-based electromagnetic analyses
M. Farina
,
T. Rozzi
2001
Corpus ID: 110365303
A short-open calibration (SOC) technique for deembedding structures with an arbitrary, possibly coupled, number of ports is…
Expand
Highly Cited
1997
Highly Cited
1997
A single-electron device and circuit simulator
C. Wasshuber
,
H. Kosina
1997
Corpus ID: 41571750
We introduce a single-electron device and circuit simulator, called SIMON, with the following features. Tunnel junctions…
Expand
1996
1996
Diffusion in zeolites via cage-to-cage kinetics: Modeling benzene diffusion in Na-Y
S. Auerbach
,
H. Metiu
1996
Corpus ID: 54801070
We have performed kinetic Monte Carlo simulations of benzene diffusion in Na‐Y (Si:Al=2.0) over the temperature range 200–500 K…
Expand
Highly Cited
1982
Highly Cited
1982
A three-dimensional analysis of semiconductor devices
A. Yoshii
,
H. Kitazawa
,
M. Tomizawa
,
S. Horiguchi
,
T. Sudo
IEEE Transactions on Electron Devices
1982
Corpus ID: 43421528
An accurate three-dimensional analysis of semiconductor devices based on the general transport equations is carried out. In this…
Expand
Highly Cited
1977
Highly Cited
1977
A Passband Data-Driven Echo Canceller for Full-Duplex Transmission on Two-Wire Circuits
S. Weinstein
IEEE Transactions on Communications
1977
Corpus ID: 62235066
A digitally-implemented echo canceller operating at a rate greater than twice the highest passband frequency is proposed for…
Expand
Highly Cited
1967
Highly Cited
1967
JOB SHOPS SCHEDULING WITH DUE DATES
S. Eilon
,
R. M. Hodgson
1967
Corpus ID: 62136639
SUMMARY A simulation model is developed for a jobbing shop, which consists of two identical machines operating in parallel. Jobs…
Expand