Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks (Q3586083)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks |
scientific article |
Statements
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks (English)
0 references
3 September 2010
0 references
