Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 210,197,296 papers from all fields of science

Search

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

Highly Cited

2010

Highly Cited

2010

Understanding the evolutionary history of living organisms is a central problem in biology. Until recently the ability to infer…

Highly Cited

2009

Highly Cited

2009

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our…

Highly Cited

2009

Highly Cited

2009

In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization…

Highly Cited

2008

Highly Cited

2008

A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al. (Mach. Learn. 56:9–33, 2004), is not…

Highly Cited

2008

Highly Cited

2008

Given the density matrix ρ of a bipartite quantum state, the quantum separability prob-lem asks whether ρ is entangled or…

Review

2008

Review

2008

Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a…

Highly Cited

2003

Highly Cited

2003

Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains…

Highly Cited

1997

Highly Cited

1997

We introduce a new low-degree-test, one that uses the restriction of low-degree polynomials to planes (i. e., afine sub-spaces of…

Highly Cited

1995

Highly Cited

1995

We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved by…

Highly Cited

1980

Highly Cited

1980

Suppose that an independence system $(E,\mathcal {I})$ is characterized by a subroutine which indicates in unit time whether or…