Upper bounds for the expected length of a longest common subsequence of two binary sequences
Κύριοι συγγραφείς: | Dancik, V. (Συγγραφέας), Paterson, M. (Συγγραφέας) |
---|---|
Μορφή: | Βιβλίο |
Γλώσσα: | English |
Σειρά: | Research Report
250 |
Θέματα: |
Παρόμοια τεκμήρια
-
Lower bounds for Union-Split-FIND related problems on rendom access machines
ανά: Miltersen Bro, Peter -
PI mass production and an optimal circuit for the nechiporuk slice
ανά: Hiltgen, Alain P., κ.ά. -
Consistency of natural relations on sets
ανά: Koizumi, H., κ.ά. -
Surface reconstruction between simple polygons via angle criteria B 94-11, April 1994
ανά: Welzl, Emo, κ.ά. -
Fast greedy triangulation algorithms B 94-09 April 1994
ανά: Dickerson, Matthew T., κ.ά.