Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ÉMILE LARROQUE:
All reports by Author Émile Larroque:

TR26-206 | 22nd September 2026
Chandrima Kayal, Sophie Laplante, Émile Larroque, Krisjanis Prusis, Jevgenijs Vihrovs

Certification complexity of Boolean functions

Certificate complexity $(C(f ))$ is a fundamental measure of complexity of Boolean functions $f$
which counts the number of bits of an input that need to be known in order for the value of the
function to be determined. A certificate can be viewed as a partial assignment, or a ... more >>>




ISSN 1433-8092 | Imprint