129 search results - page 1 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
ECCC
2006
13 years 4 months ago
2006
STACS
2010
Springer
13 years 11 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
SIAMCOMP
2010
12 years 11 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...