Pages that link to "Item:Q795503"
From MaRDI portal
The following pages link to The critical complexity of graph properties (Q795503):
Displaying 12 items.
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- Properties of complexity measures for PRAMs and WRAMs (Q580980) (← links)
- Block sensitivity of minterm-transitive functions (Q719324) (← links)
- On induced subgraphs of the cube (Q1107541) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions (Q1887146) (← links)
- Certificate complexity of elementary symmetric Boolean functions (Q2089681) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- Block sensitivity of weakly symmetric functions (Q2382286) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)
- On the relationship between energy complexity and other Boolean function measures (Q5918744) (← links)
