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)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- Youze Tang, Xiaokui Xiao, Yanchen Shi
- SIGMOD Conference
- 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)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- Changchang Wu
- 2013 International Conference on 3D Vision
- 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)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Gildas Avoine, Etienne Dysli, Philippe Oechslin
- Selected Areas in Cryptography
- 2005

Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like toâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Sidharth Jaggi, Peter Sanders, +4 authors Ludo M. G. M. Tolhuizen
- IEEE Transactions on Information Theory
- 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)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
- Theor. Comput. Sci.
- 2004

We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods areâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Nikolaus Hansen, Sibylle D. MÃ¼ller, Petros Koumoutsakos
- Evolutionary Computation
- 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

- Russell Impagliazzo, Ramamohan Paturi
- J. Comput. Syst. Sci.
- 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)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Leslie G. Valiant
- Theor. Comput. Sci.
- 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)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- Larry J. Stockmeyer, Albert R. Meyer
- STOC
- 1973

The equivalence problem for Kleene's regular expressions has several effective solutions, all of which are computationallyâ€¦Â (More)

Is this relevant?