On the Complexity of Finding an Unknown Cut Via Vertex Queries (Q3608870)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Complexity of Finding an Unknown Cut Via Vertex Queries |
scientific article; zbMATH DE number 5523862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Finding an Unknown Cut Via Vertex Queries |
scientific article; zbMATH DE number 5523862 |
Statements
On the Complexity of Finding an Unknown Cut Via Vertex Queries (English)
0 references
6 March 2009
0 references
0.7656671404838562
0 references
0.7448886632919312
0 references
0.7380622625350952
0 references
0.7303037047386169
0 references
