TIT
2008
14 years 17 days ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
COCO
2003
Springer
14 years 5 months ago
2003
Springer
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability corr...