Pages that link to "Item:Q4636652"
From MaRDI portal
The following pages link to On the Sensitivity Complexity of k-Uniform Hypergraph Properties (Q4636652):
Displaying 4 items.
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- On the sensitivity complexity of bipartite graph properties (Q1935792) (← links)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)