461 search results - page 76 / 93 » Practical polynomial factoring in polynomial time |
IJCAI
2003
13 years 8 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
DATAMINE
2010
13 years 7 months ago
2010
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
TC
2008
13 years 7 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...