Algorithms for Circuits and Circuits for Algorithms

Williams, Ryan

Title:

Algorithms for Circuits and Circuits for Algorithms

dc.contributor.author	Williams, Ryan	en_US
dc.contributor.corporatename	Georgia Institute of Technology. Algorithms, Randomness and Complexity Center	en_US
dc.contributor.corporatename	Almaden Research Center (IBM Research)	en_US
dc.contributor.corporatename	Georgia Institute of Technology. School of Mathematics	en_US
dc.contributor.corporatename	Georgia Institute of Technology. School of Computer Science	en_US
dc.date.accessioned	2011-11-30T21:07:00Z
dc.date.available	2011-11-30T21:07:00Z
dc.date.issued	2011-11-11
dc.description	Presented on November 11, 2011 in Klaus 1116	en_US
dc.description	Runtime: 53:10 minutes	en_US
dc.description.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.	en_US
dc.format.extent	53:10 Minutes	en_US
dc.identifier.uri	http://hdl.handle.net/1853/42029
dc.language.iso	en_US	en_US
dc.publisher	Georgia Institute of Technology	en_US
dc.relation.ispartofseries	ARC Theory Day	en_US
dc.subject	Circuit-analysis algorithms	en_US
dc.title	Algorithms for Circuits and Circuits for Algorithms	en_US
dc.type	Moving Image
dc.type.genre	Lecture
dspace.entity.type	Publication
local.contributor.corporatename	Algorithms and Randomness Center
local.contributor.corporatename	College of Computing
local.relation.ispartofseries	ARC Theory Day
relation.isOrgUnitOfPublication	b53238c2-abff-4a83-89ff-3e7b4e7cba3d
relation.isOrgUnitOfPublication	c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication	7019ba80-e025-4641-8487-0f848ed1e1c3