Sciweavers

65
Voted
COCO
2003
Springer
64views Algorithms» more  COCO 2003»
15 years 2 months ago
Proving SAT does not have Small Circuits with an Application to the Two
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...
Lance Fortnow, Aduri Pavan, Samik Sengupta