Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries

We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded adversary? We rule out this possibility. More precisely, assuming SAT does not have small circuits, we show that for every language

• Type: Conference
• Year: 2006
• Where: COCO
• Authors: Albert Atserias
• Keywords: Algorithms, COCO 2006, Polynomialtime Bounded Adversary, Small Boolean Circuits, Small Circuits