REVIEW
On Block Sensitivity and Fractional Block Sensitivity
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
On Block Sensitivity and Fractional Block Sensitivity
read the original abstract
We investigate the relation between the block sensitivity $\text{bs}(f)$ and fractional block sensitivity $\text{fbs}(f)$ complexity measures of Boolean functions. While it is known that $\text{fbs}(f) = O(\text{bs}(f)^2)$, the best known separation achieves $\text{fbs}(f) = \left(\frac{1}{3\sqrt2} +o(1)\right) \text{bs(f)}^{3/2}$. We improve the constant factor and show a family of functions that give $\text{fbs}(f) = \left(\frac{1}{\sqrt6}-o(1)\right) \text{bs}(f)^{3/2}.$
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.