Submodular containment is hard, even for networks (Q2564307)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Submodular containment is hard, even for networks |
scientific article |
Statements
Submodular containment is hard, even for networks (English)
0 references
14 July 1997
0 references
submodularity
0 references
complexity
0 references
networks
0 references
submodular base polyhedra
0 references
strongly co-NP-complete
0 references
dynamic games
0 references
0 references
