✦ LIBER ✦

The complexity of Boolean matrix root computation

✍ Scribed by Martin Kutz

Book ID: 108280935
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 272 KB
Volume: 325
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of monotone networks for Bool

Complexity of monotone networks for Boolean matrix product

✍ Michael S. Paterson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 994 KB

The communication complexity of several

The communication complexity of several problems in matrix computation

✍ Jeff I Chu; Georg Schnitger 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 747 KB

The communication complexity of a function f measures the communication resources required for computingf. In the design of VLSI systems, where savings on the chip area and computation time are desired, this complexity dictates an area x time\* lower bound. We investigate the communication complexit

On the Computation of the Matrix k-th Ro

On the Computation of the Matrix k-th Root

✍ Slobodan Lakić 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

Communication complexity of matrix compu

Communication complexity of matrix computation over finite fields

✍ J. I. Chu; G. Schnitger 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 764 KB

Computing the maximum generalized invers

Computing the maximum generalized inverse of a Boolean matrix

✍ D.G. Fitz-Gerald 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 249 KB

On the computation of a matrix inverse s

On the computation of a matrix inverse square root

✍ Nagwa Sherif 📂 Article 📅 1991 🏛 Springer Vienna 🌐 English ⚖ 426 KB