✦ LIBER ✦

A2.5nlower bound on the monotone network complexity ofT3n

✍ Scribed by Paul E. Dunne

Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 446 KB
Volume: 22
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264232

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound on the monotone networ

A new lower bound on the monotone network complexity of Boolean sums

✍ Ingo Wegener 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

An Ω(n43) lower bound on the monotone ne

An Ω(n43) lower bound on the monotone network complexity of the nth degree convolution

✍ Norbert Blum 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 510 KB

A note on the monotone complexity of 2-R

A note on the monotone complexity of 2-REF

✍ Peter Clote 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Lower bounds on monotone complexity of t

Lower bounds on monotone complexity of the logical permanent

✍ A. A. Razborov 📂 Article 📅 1985 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 619 KB

On the Complexity of Distributed Network

On the Complexity of Distributed Network Decomposition

✍ Alessandro Panconesi; Aravind Srinivasan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 200 KB

In this paper, we improve the bounds for computing a network decomposition Ž ⑀ Ž n. ⑀ Ž n. . distributively and deterministically. Our algorithm computes an n , n - ## Ž . decomposition in n time, where ⑀ n s 1r log n . As a corollary we obtain ' improved deterministic bounds for distributively c