Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ERIC BINNENDYK:
All reports by Author Eric Binnendyk:

TR21-132 | 11th September 2021
Eric Binnendyk

Pseudo-random functions and uniform learnability

Boolean circuits are a model of computation. A class of Boolean circuits is called a polynomial class if the number of nodes is bounded by a polynomial function of the number of input variables. A class $C_n[s(n)]$ of Boolean functions is called learnable if there are algorithms that can approximate ... more >>>




ISSN 1433-8092 | Imprint