✦ LIBER ✦

Path Complexity of Logic Networks

✍ Scribed by Hayes, J.P.

Book ID: 114606173
Publisher: IEEE
Year: 1978
Tongue: English
Weight: 750 KB
Volume: C-27
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.1978.1675127

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Numerical Complexity of Short-Cir

On the Numerical Complexity of Short-Circuit Faults in Logic Networks

✍ Sinha, B.P.; Bhattacharya, B.B. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 998 KB

Complexity of probabilistic reasoning in

Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

✍ Solomon E Shimony; Carmel Domshlak 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Directed-path (DP) singly-connected Bayesian networks are an interesting special case that, in particular, includes both polytrees and two-level networks. We analyze the computational complexity of these networks. The prediction problem is shown to be easy, as standard message passing can perform co

Paths to Synchronization on Complex Netw

Paths to Synchronization on Complex Networks

✍ Gómez-Gardeñes, Jesús; Moreno, Yamir; Arenas, Alex 📂 Article 📅 2007 🏛 The American Physical Society 🌐 English ⚖ 331 KB

A low complexity shortest path tree rest

A low complexity shortest path tree restoration scheme for IP networks

✍ Huan Chen; Po-Kai Tseng 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 391 KB

Path of logical science

✍ John C. Stephens 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Complexity of path traffic grooming

✍ Iyer, Prashant; Dutta, Rudra; Savage, Carla D. 📂 Article 📅 2007 🏛 Optical Society of America 🌐 English ⚖ 148 KB