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

On the depth complexity of the counting functions

โœ Scribed by Andrew Chin


Book ID
107765885
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
255 KB
Volume
35
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The complexity of counting homeomorphs
โœ Graham Farr; Colin McDiarmid ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB
Counting Functions and Expected Values f
โœ Wilfried Meidl; Harald Niederreiter ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

In cryptology, complexity measures for sequences of elements of a "nite "eld, such as the linear complexity, play an important role. Cryptographically strong sequences or "nite strings must not only have a large linear complexity, but also the change of a few terms must not cause a signi"cant decrea