283 search results - page 1 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
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 ...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
STOC
1998
ACM
13 years 9 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
PKC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
SIAMCOMP
2008
13 years 4 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...