✦ LIBER ✦

On the complexity of vector computations in binary tree machines

✍ Scribed by Donald MacDavid Tolle; William E. Siddall

Book ID: 113162388
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 595 KB
Volume: 13
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90124-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on computing the similarity of

Comments on computing the similarity of binary trees

✍ J.P. Jarvis; J.K. Luedeman; D.R. Shier 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 358 KB

On the solution of a quadratic vector eq

On the solution of a quadratic vector equation arising in Markovian Binary Trees

✍ Dario A. Bini; Beatrice Meini; Federico Poloni 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A Note on the Location of the Binary Poi

A Note on the Location of the Binary Point in a Computing Machine

✍ Hamming, R. W.; Mammel, W. L. 📂 Article 📅 1965 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 403 KB

Notes on the complexity of sorting in ab

Notes on the complexity of sorting in abstract machines

✍ Martti Penttonen; Jyrki Katajainen 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 759 KB

Note on complexity of computing the domi

Note on complexity of computing the domination of binary systems

✍ A.A. Chernyak; Zh.A. Chernyak 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 419 KB

The problem of computing the domination of a coherent binary system all minimal paths sets of which have equal cardinality k (k > l), is proved to be #P-complete. Some corollaries are given.

Parallel Computation of the Fast Fourier

Parallel Computation of the Fast Fourier Transform on a Binary Tree Multiprocessor

✍ Noboru Niki; Yoshizou Takahashi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 766 KB