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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
010002000300019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Given a social network <i>G</i> and a constant $k$, the <i>influence maximization</i> problem asks for <i>k</i> nodes in <i>G</i… (More)
  • table 1
  • table 2
  • figure 5
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2013
Highly Cited
2013
The time complexity of incremental structure from motion (SfM) is often known as O(n^4) with respect to the number of cameras. As… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a novel evolutionary optimization strategy based on the derandomized evolution strategy with covariance… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The k-SAT problem is to determine if a given k-CNF has a satisfying assignment. It is a celebrated open question as to whether it… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some… (More)
  • table I
Is this relevant?
Highly Cited
1979
Highly Cited
1979
where the summation is over the n! permutations of (1,2, . . . , n). It is the same as the determinant except that all the terms… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1973
Highly Cited
1973
The equivalence problem for Kleene's regular expressions has several effective solutions, all of which are computationally… (More)
Is this relevant?