A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_29 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2101954823 / rank | |||
Normal rank | |||
Revision as of 03:03, 20 March 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
