4860 search results - page 326 / 972 » SNPs Problems, Complexity, and Algorithms |
105
click to vote
CRYPTO
2007
Springer
15 years 7 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
104
click to vote
DCG
2010
14 years 11 months ago
2010
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...
111
Voted
ICDT
2003
ACM
15 years 6 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
STOC
1989
ACM
15 years 4 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
102
click to vote
EDBTW
2010
Springer
15 years 7 months ago
2010
Springer
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...