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

The effect of table expansion on the program complexity of perfect hash functions

โœ Scribed by Harry G. Mairson


Publisher
Springer Netherlands
Year
1992
Tongue
English
Weight
648 KB
Volume
32
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The effect of semantic complexity on the
โœ Barbee T. Mynatt ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science โš– 682 KB

An important variable affecting the comprehension of programs is their psychological complexity. While some work has been done on surface or low-level semantic features which affect complexity (e.g. variable-naming and indentation), little has been done on the effects of higher-level semantic featur

The complexity of functions on lattices
โœ J.W. Sander; R. Tijdeman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 212 KB

Let f : Z โ†’ {0; 1} be a given function. In 1938, Morse and Hedlund observed that if the number of distinct vectors (f(x + 1); : : : ; f(x + n)), x โˆˆ Z, called complexity, is at most n for some positive integer n, then f is periodic with period at most n. This result is best possible. Functions with