Pages that link to "Item:Q5300493"
From MaRDI portal
The following pages link to A Lower Bound for the Complexity of Monotone Graph Properties (Q5300493):
Displaying 15 items.
- A lower bound for metric 1-median selection (Q340556) (← links)
- An asymptotic bound for the complexity of monotone graph properties (Q653841) (← links)
- On the typical structure of graphs in a monotone property (Q740672) (← links)
- Lower bounds to randomized algorithms for graph properties (Q808708) (← links)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
- Decision tree complexity of graph properties with dimension at most 5 (Q1587333) (← links)
- Evasive properties of sparse graphs and some linear equations in primes (Q2253204) (← links)
- Any monotone property of 3-uniform hypergraphs is weakly evasive (Q2348256) (← links)
- Evasiveness of graph properties and topological fixed-point theorems (Q2872493) (← links)
- Improved lower bounds on the randomized complexity of graph properties (Q3437025) (← links)
- (Q4036171) (← links)
- Every monotone graph property has a sharp threshold (Q4717065) (← links)
- Lower bounds for monotonic list labeling (Q5056101) (← links)
- Monotone Properties of <i>k</i> -Uniform Hypergraphs Are Weakly Evasive (Q5205809) (← links)
- Elusive properties of infinite graphs (Q6144919) (← links)
