✦ LIBER ✦

Algorithms for Dualization over Products of Partially Ordered Sets

✍ Scribed by Elbassioni, Khaled M.

Book ID: 118197557
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 386 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/050622250

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some optimal algorithms for decomposed p

Some optimal algorithms for decomposed partially ordered sets

✍ Vijay K. Garg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Chen-Fox-Lyndon Factorization for Words

Chen-Fox-Lyndon Factorization for Words over Partially Ordered Sets

✍ M. Hazewinkel 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 101 KB

Adjoint functors, projectivization, and

Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets

✍ Mark Kleiner; Markus Reitenbach 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Topologies on products of partially orde

Topologies on products of partially ordered sets I: Interval topologies

✍ Marcel Erné 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 784 KB

Topologies on products of partially orde

Topologies on products of partially ordered sets II: Ideal topologies

✍ Marcel Erné 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 359 KB

The greedy algorithm for partially order

The greedy algorithm for partially ordered sets

✍ Ulrich Faigle 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Those independence systems on finite partially ordered sets are characterized for which the greedy algorithm always works. 'Fhe greedy ulgsrithm far gtartIally ordered fete