Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes

Guillaume Malod. Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. In Olaf Owe, Martin Steffen, Jan Arne Telle, editors, Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. Volume 6914 of Lecture Notes in Computer Science, pages 205-216, Springer, 2011. [doi]

Abstract

Abstract is missing.