A Lower Bound for the Complexity of Monotone Graph Properties (Q5300493): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/siamdm/ScheidweilerT13, #quickstatements; #temporary_batch_1731547958265 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/120888703 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024979825 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56701666 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamdm/ScheidweilerT13 / rank | |||
Normal rank | |||
Latest revision as of 03:18, 14 November 2024
scientific article; zbMATH DE number 6181912
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lower Bound for the Complexity of Monotone Graph Properties |
scientific article; zbMATH DE number 6181912 |
Statements
A Lower Bound for the Complexity of Monotone Graph Properties (English)
0 references
27 June 2013
0 references
evasiveness
0 references
decision tree complexity
0 references
graph properties
0 references
