Pages that link to "Item:Q653841"
From MaRDI portal
The following pages link to An asymptotic bound for the complexity of monotone graph properties (Q653841):
Displaying 20 items.
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- On the typical structure of graphs in a monotone property (Q740672) (← links)
- The critical complexity of graph properties (Q795503) (← links)
- A lower bound for the recognition of digraph properties (Q810043) (← links)
- A topological approach to evasiveness (Q1065831) (← 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)
- A generalized model for understanding evasiveness (Q1825645) (← links)
- On the recognition complexity of some graph properties (Q1924495) (← links)
- Complexity of edge monitoring on some graph classes (Q2172388) (← links)
- Any monotone property of 3-uniform hypergraphs is weakly evasive (Q2348256) (← links)
- Evasiveness of graph properties and topological fixed-point theorems (Q2872493) (← links)
- Evasiveness and the Distribution of Prime Numbers (Q3113738) (← links)
- Monotone Bipartite Graph Properties are Evasive (Q3792707) (← links)
- (Q4036171) (← links)
- Monotone Properties of <i>k</i> -Uniform Hypergraphs Are Weakly Evasive (Q5205809) (← links)
- A Lower Bound for the Complexity of Monotone Graph Properties (Q5300493) (← links)
- Morse theory and evasiveness (Q5932751) (← links)
- Measures on monotone properties of graphs (Q5957296) (← links)
- Query complexity of tournament solutions (Q6122601) (← links)
