Pages that link to "Item:Q974756"
From MaRDI portal
The following pages link to On the parity complexity measures of Boolean functions (Q974756):
Displaying 20 items.
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions (Q1851549) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- 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)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← 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)
- Complexity of implementation of parity functions in the ``implication-negation'' basis (Q2820943) (← links)
- Parity decision tree complexity and 4-party communication complexity of XOR-functions are polynomially equivalent (Q2825306) (← links)
- Separating completely complexity classes related to polynomial size \(\Omega\)-decision trees (Q3974860) (← links)
- Structure of Protocols for XOR Functions (Q4605274) (← links)
- (Q5028429) (← 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)
