Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,628 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
2015
Highly Cited
2015
Analysis, properties and control of an eight-term 3-D chaotic system with an exponential nonlinearity
S. Vaidyanathan
International journal of Modeling, identification…
2015
Corpus ID: 27519645
In this research work, an eight-term 3-D novel chaotic system with an exponential nonlinearity has been derived. The basic…
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
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
2006
Highly Cited
2006
Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks
M. Neely
Proceedings IEEE INFOCOM . 25TH IEEE…
2006
Corpus ID: 9983501
We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly…
Expand
Highly Cited
2003
Highly Cited
2003
On the deployment of picocellular wireless infrastructure
M. Unbehaun
,
Max 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
1994
Highly Cited
1994
Multiuser detection for optical code division multiple access systems
M. Brandt-Pearce
,
B. Aazhang
IEEE Transactions on Communications
1994
Corpus ID: 38699505
Considers a multiuser detection scheme for optical direct sequence code division multiple access (OCDMA) systems, referred to as…
Expand
Review
1971
Review
1971
Real-Time Recognition of Spoken Words
L. Pols
IEEE transactions on computers
1971
Corpus ID: 30027604
First a survey is given of a number of published vowel and word recognition systems. Then a new real-time word recognition system…
Expand