The following pages link to (Q5368747):
Displaying 15 items.
- The equivalence of two problems on the cube (Q1194759) (← links)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions (Q2800553) (← links)
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling (Q4575405) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- Pseudorandom generators for low sensitivity functions (Q4993293) (← links)
- New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity (Q5090948) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- (Q5121889) (← links)
- On the resolution of the sensitivity conjecture (Q5123060) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
- Complexity of quantum circuits via sensitivity, magic, and coherence (Q6564161) (← links)
