Decision tree complexity of graph properties with dimension at most 5 (Q1587333): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Sui-Xiang Gao / rank | |||
| Property / author | |||
| Property / author: Sui-Xiang Gao / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A topological approach to evasiveness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complete subgraphs are elusive / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Results on Elusive Graph Properties / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02950404 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061130392 / rank | |||
Normal rank | |||
Latest revision as of 10:40, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decision tree complexity of graph properties with dimension at most 5 |
scientific article |
Statements
Decision tree complexity of graph properties with dimension at most 5 (English)
0 references
28 May 2001
0 references
monotone graph property
0 references
