Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Review

2019

Review

2019

Thanks to the recent advances in processing speed, data acquisition and storage, machine learning (ML) is penetrating every facet… Expand

Is this relevant?

Review

2018

Review

2018

The increasingly rapid creation, sharing and exchange of information nowadays put researchers and data scientists ahead of a… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

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

Is this relevant?

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… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

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… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of… Expand

Is this relevant?

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… Expand

Is this relevant?

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… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

Le probleme de calcul du mouvement de gestion pour un systeme robotise simple a ete etudie plus recemment a partir d'un point de… Expand

Is this relevant?