Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth

Michael Elberfeld, Andreas Jakoby, Till Tantau. Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. In Christoph Dürr, Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. Volume 14 of LIPIcs, pages 66-77, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

Abstract

Abstract is missing.