Title:
Algorithms for Circuits and Circuits for Algorithms
Algorithms for Circuits and Circuits for Algorithms
No Thumbnail Available
Author(s)
Williams, Ryan
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
Connections have been recently developed between the existence of non-trivial circuitanalysis algorithms and proofs of circuit size lower bounds. Algorithms that can check whether a given circuit from some class satisfies a simple property (such as computing the all-zeroes function) can be used to prove limitations on that circuit class, provided the algorithms run slightly faster than exhaustive search. More precisely, a non-trivial SAT algorithm for a circuit class can be used to find functions computable in nondeterministic exponential time that cannot be computed by that circuit class. Informally, this connection can be interpreted as saying "good algorithms for circuits imply there are no good circuits for some algorithms." This talk will explore the ideas behind this theme and the potential for further progress.
Sponsor
Date Issued
2011-11-11
Extent
53:10 Minutes
Resource Type
Moving Image
Resource Subtype
Lecture