On the sensitivity complexity of bipartite graph properties (Q1935792)
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 sensitivity complexity of bipartite graph properties |
scientific article; zbMATH DE number 6137338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sensitivity complexity of bipartite graph properties |
scientific article; zbMATH DE number 6137338 |
Statements
On the sensitivity complexity of bipartite graph properties (English)
0 references
19 February 2013
0 references
sensitivity complexity
0 references
bipartite graph
0 references
graph properties
0 references
Turan conjecture
0 references
decision tree
0 references
0.8752551078796387
0 references
0.8151806592941284
0 references
0.7937018871307373
0 references
0.7532536387443542
0 references
0.7473255395889282
0 references
