Random walk in a simplex and quadratic optimization over convex polytopes

85 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Most Tensor Problems Are NP-Hard (2009, methodology): “For the first theorem, we reduce the decision problem to that of computing the max-clique number for a graph, extending some ideas from [37] and [25].”