127 search results - page 13 / 26 » Computational Complexity of Some Problems Involving Congruen... |
RECOMB
2002
Springer
14 years 7 months ago
2002
Springer
A current high-priority phase of human genomics involves the development of a full Haplotype Map of the human genome [23]. It will be used in large-scale screens of populations to...
SIAMREV
2010
13 years 2 months ago
2010
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
STOC
2000
ACM
13 years 12 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...