The following pages link to (Q3674058):
Displaying 13 items.
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- Properties of complexity measures for PRAMs and WRAMs (Q580980) (← links)
- On induced subgraphs of the cube (Q1107541) (← links)
- The equivalence of two problems on the cube (Q1194759) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma (Q2948459) (← links)
- (Q4993293) (← links)
- Does Looking Inside a Circuit Help (Q5111215) (← links)
- (Q5121889) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
