๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the space complexity of some algorithms for sequence comparison

โœ Scribed by Yuval Rabani; Zvi Galil

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
670 KB
Volume
95
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Complexity of Exclusion Algorithm
On the Complexity of Exclusion Algorithms for Optimization
โœ Eugene Allgower; Melissa Erdmann; Kurt Georg ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 133 KB

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa

A note on the space complexity of some d
A note on the space complexity of some decision problems for finite automata
โœ Tao Jiang; B. Ravikumar ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 533 KB

In this note, we establish the space complexity of decision problems (such as membership, nonemptiness and equivalence) for some finite automata. Our study includes 2-way infinite automata with a pebble.

On Some Convexity Properties of Orlicz S
On Some Convexity Properties of Orlicz Sequence Spaces Equipped with the Luxemburg Norm
โœ Henryk Hudzik; Diethard Pallaschke ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 876 KB

Rotundity of finite-diii~eilsioiial Orlin spaces 1: equipped with the Luxemburg nomi is considered. It is proved that criteria for rotundity of 1: for 11 2 3 does not depend on 11 and are the same as the criteria for rotundity of the inhite-dimensional subspace h\* of an Orlicz sequence ~p a c e . 1