On the sensitivity complexity of bipartite graph properties (Q1935792): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974514669 / rank | |||
Normal rank | |||
Latest revision as of 18:42, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the sensitivity complexity of bipartite graph properties |
scientific article |
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
