Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,771 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
Highly Cited
2011
Highly Cited
2011
Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks
S. Sharangi
,
Ramesh Krishnamurti
,
M. Hefeeda
IEEE transactions on multimedia
2011
Corpus ID: 15096604
The Multicast/Broadcast Service (MBS) feature of mobile WiMAX network is a promising technology for providing wireless multimedia…
Expand
Highly Cited
2010
Highly Cited
2010
Stability analysis for cognitive radio with multi-access primary transmission
I. Krikidis
,
N. Devroye
,
John S. Thompson
IEEE Transactions on Wireless Communications
2010
Corpus ID: 17739186
This letter analyzes the impact, from a network-layer perspective, of having a single cognitive radio transmitter-receiver pair…
Expand
Highly Cited
2003
Highly Cited
2003
On the deployment of picocellular wireless infrastructure
M. Unbehaun
,
M. Kamenetsky
IEEE wireless communications
2003
Corpus ID: 206490131
Wireless LANs are becoming increasingly common in both home and office networks. Additionally, wireless Internet service…
Expand
Highly Cited
1999
Highly Cited
1999
Robust synthesis of feedforward compensators
Á. Giusto
,
F. Paganini
IEEE Transactions on Automatic Control
1999
Corpus ID: 4071389
The design of a feedforward compensator for robust /spl Hscr//sub /spl infin// or /spl Hscr//sub 2/ performance under structured…
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
Highly Cited
1993
Highly Cited
1993
Synchronizing sequences and symbolic traversal techniques in test generation
Hyunwoo Cho
,
Seh-Woong Jeong
,
F. Somenzi
,
C. Pixley
Journal of electronic testing
1993
Corpus ID: 30581773
Asynchronizing sequence drives a circuit from an arbitrary power-up state into a unique state. Test generation on a circuit…
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
1969
Highly Cited
1969
Improving communication reliability by use of an intermittent feedback channel
A. J. Kramer
IEEE Transactions on Information Theory
1969
Corpus ID: 29528574
This paper describes and analyzes a feedback communication scheme where the feedback channel is used only to inform the…
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