Pages that link to "Item:Q974756"
From MaRDI portal
The following pages link to On the parity complexity measures of Boolean functions (Q974756):
Displayed 13 items.
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- On the decision tree complexity of threshold functions (Q2095465) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Structure of Protocols for XOR Functions (Q4605274) (← links)
- On the Decision Tree Complexity of Threshold Functions (Q5042240) (← links)
- (Q5121896) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5918630) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5925692) (← links)