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
โฆ 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
Polynomial expansion of symmetric boolea
โ
L. B. Avgul'
๐
Article
๐
1996
๐
Springer US
๐
English
โ 435 KB
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
On the Impossibility of Highly-Efficient
โ
J. Black; M. Cochran; T. Shrimpton
๐
Article
๐
2008
๐
Springer
๐
English
โ 490 KB
On the complexity of finite random funct
โ
Uriel Feige
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 158 KB
More on the complexity of slice function
โ
Ingo Wegener
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 664 KB