19866 search results - page 151 / 3974 » Computing all factorizations in *** |
189
click to vote
ASIACRYPT
2007
Springer
16 years 20 days ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
247
click to vote
ECCC
2011
15 years 1 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
179
click to vote
AIPS
2009
15 years 7 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
203
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
161
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...