✦ LIBER ✦

A new algorithmic scheme for computing characteristic sets

✍ Scribed by Meng Jin; Xiaoliang Li; Dongming Wang

Book ID: 118480747
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 299 KB
Volume: 50
Category: Article
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2012.04.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial-time algorithm for computin

A polynomial-time algorithm for computing characteristic strings under a set of strings

✍ Minoru Ito; Kuniyasu Shimizu; Michio Nakanishi; Akihiro Hashimoto 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 805 KB

A new algorithm for computing the convex

A new algorithm for computing the convex hull of a planar point set

✍ Guang-hui Liu; Chuan-bo Chen 📂 Article 📅 2007 🏛 SP Zhejiang University Press 🌐 English ⚖ 284 KB

A New Algorithm for Computing Correlatio

A New Algorithm for Computing Correlations

✍ Kendall, W.B. 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 481 KB

A new approach to computing the Euler ch

A new approach to computing the Euler characteristic

✍ P.K. Saha; B.B. Chaudhuri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 825 KB

A well conditioned checksum scheme for a

A well conditioned checksum scheme for algorithmic fault tolerance

✍ Daniel L. Boley; Franklin T.Luk 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 524 KB

The computation of hitting sets: Review

The computation of hitting sets: Review and new algorithms

✍ Li Lin; Yunfei Jiang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In model-based diagnosis or other research fields, the hitting sets of a set cluster are usually used. In this paper we introduce some algorithms, including the new BHS-tree and Boolean algebraic algorithms. In the BHS-tree algorithm, a binary-tree is used for the computation of hitting sets, and in