Pages that link to "Item:Q1194759"
From MaRDI portal
The following pages link to The equivalence of two problems on the cube (Q1194759):
Displaying 8 items.
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions (Q1887146) (← links)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- (Q5089234) (← links)
- On the resolution of the sensitivity conjecture (Q5123060) (← links)
- DERANDOMIZED LEARNING OF BOOLEAN FUNCTIONS OVER FINITE ABELIAN GROUPS (Q5249274) (← links)
- On induced subgraphs of the Hamming graph (Q6055388) (← links)
- Induced subgraphs of product graphs and a generalization of Huang's theorem (Q6056784) (← links)
