A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640): Difference between revisions
From MaRDI portal
Latest revision as of 04:50, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row |
scientific article |
Statements
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (English)
0 references
17 June 2011
0 references
0 references
0 references
0 references