Showing 2026 · cs.CCShow all
2 papers · 2 filters
cs.CC2026
No Perfect Randomized Composition
Alexander Meiburg
Does computing a composition of total Boolean functions require the product of the randomized query complexities of its factors? We give a negative answer. There are families of to…
cs.CC2026
Block Sensitivity can exceed Spectral Sensitivity Squared
Alexander Meiburg
The spectral sensitivity of a Boolean function is the largest eigenvalue of the adjacency matrix of its sensitivity graph. It lower-bounds every standard measure of query co…