Sciweavers

105 search results - page 7 / 21
» On the subset sum problem over finite fields
Sort
View
MOC
2002
84views more  MOC 2002»
13 years 7 months ago
Smooth ideals in hyperelliptic function fields
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...
Andreas Enge, Andreas Stein
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
14 years 23 days ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
CC
2002
Springer
126views System Software» more  CC 2002»
13 years 7 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof
SDM
2004
SIAM
187views Data Mining» more  SDM 2004»
13 years 8 months ago
Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvri...
AAAI
2008
13 years 9 months ago
Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
Hai Leong Chieu, Wee Sun Lee