An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subgraphs of graphs. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A topological approach to evasiveness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4133137 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge disjoint placement of graphs / rank | |||
Normal rank | |||
Latest revision as of 14:01, 15 May 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
0 references
