The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes (Q2977254)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes |
scientific article |
Statements
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes (English)
0 references
28 April 2017
0 references
