Molzan, B. Expressibility and nonuniform complexity classes. (English) Zbl 0698.68047 SIAM J. Comput. 19, No. 3, 411-423 (1990). Cited in 2 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 03C80 Logic with extra quantifiers and operators 03D15 Complexity of computation (including implicit computational complexity) Keywords:computational complexity; \(AC^ 0\)-circuits; \(NC^ 1\)-circuits; nonuniform complexity classes; logical expressibility; branching programs PDF BibTeX XML Cite \textit{B. Molzan}, SIAM J. Comput. 19, No. 3, 411--423 (1990; Zbl 0698.68047) Full Text: DOI