Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds

Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "natural proofs" applies to a large class of arguments that have been used in complexity theory, and shows that no such argument can prove that a problem requires circuits of superpolynomial size, even for some very restricted classes of circuits (under reasonable cryptographic assumptions). This barrier is so daunting, that some researchers have decided to focus their attentions elsewhere. Yet the goal of proving circuit lower bounds is of such importance, that some in the community have proposed concrete strategies for surmounting the obstacle. This lecture will discuss some of these strategies, and will dwell at length on a recent approach proposed by Michal Kouck

• Type: Conference
• Year: 2008
• Where: CSR
• Authors: Eric Allender
• Keywords: CSR 2008, Lower Bounds, Problem Requires Circuits, Superpolynomial Lower Bounds, Theoretical Computer Science