works on
complexity theory 1hardness of approximation 1learning theory 1monotone circuits 1proof complexity 1

From the 1 of 6 linked papers with an AI index.

activity
20242026
collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2026

ETH-Hardness of Learning Monotone Circuits and Approximating Their Size

Bruno Cavalar, Susanna F. de Rezende, Matthew Gray +1

The paper proves that, assuming the Randomised Exponential-Time Hypothesis, both PAC-learning monotone formulas and multiplicatively approximating the minimum monotone circuit size…