19700 search results - page 3582 / 3940 » DNA-Based Computation Times |
250
click to vote
SPAA
1993
ACM
15 years 11 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
239
click to vote
STOC
1994
ACM
15 years 11 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
173
click to vote
STOC
1989
ACM
15 years 11 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
160
click to vote
SPAA
1990
ACM
15 years 11 months ago
1990
ACM
We present various experiments in Hardware/Software designtradeoffs met in speeding up long integer multiplications. This work spans over a year, with more than 12 different hardw...
207
click to vote
AIME
2009
Springer
15 years 11 months ago
2009
Springer
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...