| |
Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Miscellaneous (F.2.m)
|
|
 |
|
|
| |
|
|
| |
1-3 of 3
Reviews about "Miscellaneous (F.2.m)":
|
Date Reviewed |
| |
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Michalewicz Z., Springer-Verlag New York, Inc., New York, NY, 1994. Type: Book (9783540580904)
The idea of using genetic algorithms for optimization problems is so intuitively appealing that it is often mentioned in popular science articles. This book is a self-contained account, presupposing only basic undergraduate mathematics...
|
Aug 1 1995 |
| |
How to sign given any trapdoor permutation
Bellare M., Micali S. Journal of the ACM 39(1): 214-233, 1992. Type: Article
A trapdoor permutation is one that is easy to compute but difficult to invert unless some further information is known. The most straightforward way to use a trapdoor permutation for digital signatures is to make the permutation public...
|
Oct 1 1994 |
| |
An efficient algorithm for sequential random sampling
Vitter J. (ed) ACM Transactions on Mathematical Software 13(1): 58-67, 1987. Type: Article
The author continues his work on devising efficient algorithms to sequentially sample a small set of records from a much larger set. Most of the present paper is concerned with improved implementations of the algorithms in [1]....
|
Aug 1 1988 |
| |
|
|
| |
|
