105 search results - page 21 / 21 » On the subset sum problem over finite fields |
TIT
2008
13 years 5 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
BMCBI
2008
13 years 5 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
JAIR
2006
13 years 5 months ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
BIOINFORMATICS
2000
13 years 5 months ago
2000
Motivation: Evaluating the accuracy of predicted models is critical for assessing structure prediction methods. Because this problem is not trivial, a large number of different as...