Decision tree complexity of graph properties with dimension at most 5 (Q1587333): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Latest revision as of 09:56, 3 June 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
