A 1990 article in the American Mathematical Monthly has shown that most combinatorial identities of the type described in Monthly problems can be solved by known identity checking algorithms. A natural question arises: are these algorithms always feasible or can the number of computational steps be
Alignment and Distribution Is Not (Always) NP-Hard
β Scribed by Vincent Boudet; Fabrice Rastello; Yves Robert
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 293 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, an efficient algorithm to simultaneously implement array alignment and dataΓcomputation distribution is introduced and evaluated. We revisit previous work of J. Li and M. Chen (in ``Frontiers 90: The Third Symposium on the Frontiers of Massively Parallel Computation, '' pp. 424 433, College Park MD, Oct. 1990; and J. Parallel Distrib. Comput. 13 (1991), 213 221), and we show that their alignment step should not be conducted without preserving the potential parallelism. In other words, the optimal alignment may well sequentialize computations, whatever the distribution afterward. We provide an efficient algorithm that handles alignment and dataΓcomputation distribution simultaneously. The good news is that several important instances of the whole alignment Γdistribution problem have polynomial complexity, while alignment itself is NP-complete (Li and Chen, 1990).
π SIMILAR VOLUMES
Early occlusion of intracoronary stents has been exclusively attributed to thrombosis. Using intracoronary angioscopy, we have found 2 patients in whom this common and serious complication of coronary stenting was caused by obstructive intima dissection rather than thrombosis.