An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56701656, #quickstatements; #temporary_batch_1705500093209 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56701656 / rank | |||
Normal rank | |||
Revision as of 16:05, 17 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties |
scientific article |
Statements
An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (English)
0 references
27 June 1992
0 references
The author improves \textit{King's} \(\Omega(n^{5/4})\) (see the following review) lower bound on the randomized decision tree complexity of any nontrivial monotone graph property to \(\Omega(n^{4/3})\).
0 references
complexity of graph properties
0 references
