Finding maximal independent elements of products of partial orders (the case of chains) (Q2319829): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On generating all maximal independent sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for Dualization over Products of Partially Ordered Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotically optimal dualization algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057963 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3769993 / rank | |||
Normal rank | |||
Revision as of 05:24, 20 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximal independent elements of products of partial orders (the case of chains) |
scientific article |
Statements
Finding maximal independent elements of products of partial orders (the case of chains) (English)
0 references
20 August 2019
0 references
dualization over products of partial orders
0 references
maximal independent element
0 references
irreducible covering of a Boolean matrix
0 references
ordered covering of an integer matrix
0 references
asymptotically optimal algorithm
0 references
0 references
