Innovative Satisfiability Algorithms for Small Depth Circuits with Symmetric Gates π
Explore advanced algorithms for solving satisfiability problems in small-depth circuits featuring symmetric gates. Discover the connections to algorithm design and complexity theory in this insightful talk by Suguru Tamaki.

Simons Institute for the Theory of Computing
173 views β’ Oct 1, 2015

About this video
Suguru Tamaki, Kyoto University
Connections Between Algorithm Design and Complexity Theory
https://simons.berkeley.edu/talks/suguru-tamaki-2015-10-01
Connections Between Algorithm Design and Complexity Theory
https://simons.berkeley.edu/talks/suguru-tamaki-2015-10-01
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
173
Duration
41:44
Published
Oct 1, 2015
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.