Author:
Mix Barrington David A.,Straubing Howard,Thérien Denis
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference34 articles.
1. Σ11 formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983
2. Bounded-Width Branching Programs;Barrington,1986
3. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1;Barrington;J. Comput. System Sci.,1989
4. Non-uniform automata over groups;Barrington,1987
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity of Modular Circuits;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
2. CC-circuits and the expressive power of nilpotent algebras;Logical Methods in Computer Science;2022-05-26
3. Satisfiability in MultiValued Circuits;SIAM Journal on Computing;2022-05-05
4. On the Computational Power of Programs over $$\mathsf {BA}_2$$ Monoid;Language and Automata Theory and Applications;2021
5. Intermediate problems in modular circuits satisfiability;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08