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

A note on randomized streaming space bounds for the longest increasing subsequence problem

โœ Scribed by Amit Chakrabarti

Book ID
113663310
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
114 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower time bound for the knapsack prob
A lower time bound for the knapsack problem on random access machines
โœ Peter Klein; Friedhelm Meyer Heide ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 533 KB

a.M. (Fed. Rep.) Summary. We consider random access machines which read the input integer by integer (not bit by bit). For this computational model we prove a quadratic lower bound for the n-dimensional knapsack problem. For this purpose, we combine a method due to Paul and Simon [1] to apply decisi

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.