Fetching the paper…
Reading the bibliography…
Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$.
A decision method for elementary algebra and geometry
A. Tarski · 1951
Earlier work this paper cites.
A new decision method for elementary algebra
A. Seidenberg · 1954
Earlier work this paper cites.
On notions of information transfer in VLSI circuits
A. Aho, J. Ullman and M. Yannakakis · 1983
Earlier work this paper cites.
Communication complexity and combinatorial lattice theory
L. Lovász and M. Saks · 1988
Earlier work this paper cites.
Expressing combinatorial optimization problems by linear programs
M. Yannakakis · 1988
Earlier work this paper cites.
Lower bounds for non-commutative computation (extended abstract)
N. Nisan · 1991
Earlier work this paper cites.
On the computational complexity and geometry of the first-order theory of the reals
J. Renegar · 1992
Cited alongside, same era.
On the computational complexity of approximating solutions for real algebraic formulae
J. Renegar · 1992
Cited alongside, same era.
Nonnegative ranks, decompositions and factorizations of nonnegative matices
J. Cohen and U. Rothblum · 1993
Cited alongside, same era.
On the combinatorial and algebraic complexity of quantifier elimination
S. Basu, R. Pollack and M. Roy · 1994
Cited alongside, same era.
Matrix Computations
G. Golub and C. van Loan · 1996
Cited alongside, same era.
Complexity of Real Computations
L. Blum, F. Cucker, M. Shub and S. Smale · 1998
Cited alongside, same era.
On the complexity of k-SAT
R. Impagliazzo and R. Paturi · 2001
Later among the works it cites.
Lectures on Discrete Geometry
J. Matousek · 2002
Later among the works it cites.
On the complexity of nonnegative matrix factorization
S. Vavasis · 2009
Later among the works it cites.
Extended formulations for polygons
S. Fiorini, T. Rothvoß · 2011
Later among the works it cites.
Computing a nonnegative matrix factorization - provably
S. Arora, R. Ge, R. Kannan and A. Moitra · 2012
Closest in time.
Linear vs semidefinite extended formulations: exponential separations and strong lower bounds
S. Fiorini, S. Massar, S. Pokutta, H. Tiwary and R. de Wolf · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…