Skip to search formSkip to main contentSkip to account menu

Time complexity

Known as: N log n, Polynomial-time solutions, Cubic time 
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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Given a social network G and a constant $k$, the influence maximization problem asks for k nodes in G that (directly and… 
Highly Cited
2014
Highly Cited
2014
Deep neural nets with a large number of parameters are very powerful machine learning systems. However, overfitting is a serious… 
Highly Cited
2008
Highly Cited
2008
We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based… 
Highly Cited
2001
Highly Cited
2001
This paper describes a machine learning approach for visual object detection which is capable of processing images extremely… 
Highly Cited
1999
Highly Cited
1999
  • 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… 
Review
1998
Review
1998
  • 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… 
Highly Cited
1993
Highly Cited
1993
In this dissertation we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an… 
Highly Cited
1979
Highly Cited
1979
The complexity of the Discrete Fourier Transform (DFT) is studied with respect to a new model of computation appropriate to VLSI… 
Highly Cited
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… 
Highly Cited
1971
Highly Cited
1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to…