Parallel Computation of the Minimal Elements of a Poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimization, transversal hypergraph generation and redundant component removal, to name a few. We propose a divide-and-conquer...
Main Authors: | Leiserson, Charles E. (Contributor), Maza, Marc Moreno (Author), Li, Liyun (Author), Xie, Yuzhen (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2012-08-15T12:35:22Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Efficient Evaluation of Large Polynomials
by: Leiserson, Charles E., et al.
Published: (2014) -
Equivalent Forms for a Poset to Be Modular Poset
by: Sundarayya P., et al.
Published: (2021-05-01) -
Element-Removal Games on Acyclic Graphs and Posets
by: Lundin, Jesper
Published: (2015) -
On representable posets
by: Tan, Tey Ting Kok.
Published: (2012) -
On representable posets
by: Tan, Tey Ting Kok.
Published: (2012)