Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,836,766 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
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
2014
Highly Cited
2014
Influence maximization: near-optimal time complexity meets practical efficiency
Youze Tang
,
Xiaokui Xiao
,
Yanchen Shi
SIGMOD Conference
2014
Corpus ID: 6065023
Given a social network G and a constant $k$, the influence maximization problem asks for k nodes in G that (directly and…
Expand
Highly Cited
2014
Highly Cited
2014
Dropout: a simple way to prevent neural networks from overfitting
Nitish Srivastava
,
Geoffrey E. Hinton
,
A. Krizhevsky
,
Ilya Sutskever
,
R. Salakhutdinov
J. Mach. Learn. Res.
2014
Corpus ID: 6844431
Deep neural nets with a large number of parameters are very powerful machine learning systems. However, overfitting is a serious…
Expand
Highly Cited
2008
Highly Cited
2008
Fast unfolding of communities in large networks
V. Blondel
,
Jean-Loup Guillaume
,
R. Lambiotte
,
E. Lefebvre
2008
Corpus ID: 334423
We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based…
Expand
Highly Cited
2001
Highly Cited
2001
Rapid object detection using a boosted cascade of simple features
Paul A. Viola
,
Michael J. Jones
Proceedings of the IEEE Computer Society…
2001
Corpus ID: 2715202
This paper describes a machine learning approach for visual object detection which is capable of processing images extremely…
Expand
Highly Cited
1999
Highly Cited
1999
Object recognition from local scale-invariant features
D. Lowe
Proceedings of the Seventh IEEE International…
1999
Corpus ID: 5258236
An object recognition system has been developed that uses a new class of local image features. The features are invariant to…
Expand
Review
1998
Review
1998
Linear Matrix Inequalities In System And Control Theory
E. Yaz
Proceedings of the IEEE
1998
Corpus ID: 33963932
Preface 1. Introduction Overview A Brief History of LMIs in Control Theory Notes on the Style of the Book Origin of the Book 2…
Expand
Highly Cited
1993
Highly Cited
1993
Quantum complexity theory
Ethan Bernstein
,
U. Vazirani
STOC '93
1993
Corpus ID: 676378
In this dissertation we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an…
Expand
Highly Cited
1979
Highly Cited
1979
Area-time complexity for VLSI
C. Thompson
STOC
1979
Corpus ID: 122958880
The complexity of the Discrete Fourier Transform (DFT) is studied with respect to a new model of computation appropriate to VLSI…
Expand
Highly Cited
1978
Highly Cited
1978
The complexity of satisfiability problems
T. Schaefer
STOC
1978
Corpus ID: 17125814
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied…
Expand
Highly Cited
1971
Highly Cited
1971
The complexity of theorem-proving procedures
S. Cook
STOC
1971
Corpus ID: 7573663
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE