✦ LIBER ✦

On the parallel complexity of digraph reachability

✍ Scribed by Samir Khuller; ; ; Uzi Vishkin;

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 253 KB
Volume: 52
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00153-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Parallel Complexity of Nonsmooth Conv

On Parallel Complexity of Nonsmooth Convex Optimization

✍ A. Nemirovski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 449 KB

On the Parallel Complexity of the Polyno

On the Parallel Complexity of the Polynomial Ideal Membership Problem

✍ Peter Bürgisser 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 457 KB

The average-case parallel complexity of

The average-case parallel complexity of sorting

✍ Ravi B. Boppana 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 219 KB

On the parallel complexity of hierarchic

On the parallel complexity of hierarchical clustering and CC-complete problems

✍ Raymond Greenlaw; Sanpawat Kantabutra 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

On the parallel complexity of discrete r

On the parallel complexity of discrete relaxation in constraint satisfaction networks

✍ Simon Kasif 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 605 KB

## Constraint satisfaction networks have been shown to be a very useful tool for knowledge representation in Artificial Intelligence applications. These networks often utilize local constraint propagation techniques to achieve local consistency (consistent labeling in vision). Such methods have been

On the Parallel Complexity of Hamiltonia

On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs

✍ E. Dahlhaus; P. Hajnal; M. Karpinski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 729 KB