A polynomial-time algorithm for finding a minimal conflicting set containing a given row (Q3007640)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5908694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for finding a minimal conflicting set containing a given row |
scientific article; zbMATH DE number 5908694 |
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
0.8694132566452026
0 references
0.8477992415428162
0 references
0.8251902461051941
0 references
0.7845953702926636
0 references
