✦ 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
DOI: 10.1016/0020-0190(90)90036-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved complexity hierarchy on the

An improved complexity hierarchy on the depth of Boolean functions

✍ Ingo Wegener 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 268 KB

The complexity of symmetric functions in

The complexity of symmetric functions in bounded-depth circuits

✍ Bettina Brustmann; Ingo Wegener 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Complexity and the functions of the firm

Complexity and the functions of the firm: breadth and depth

✍ Q Wang; N von Tunzelmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 121 KB

The complexity of counting homeomorphs

✍ Graham Farr; Colin McDiarmid 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Recursion theoretic characterizations of

Recursion theoretic characterizations of complexity classes of counting functions

✍ Heribert Vollmer; Klaus W. Wagner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 918 KB

Counting Functions and Expected Values f

Counting Functions and Expected Values for the k-Error Linear Complexity

✍ 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