Author:
Beame Paul,Brisson Erik,Ladner Richard
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Σ11 formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983
2. A note on the power of threshold circuits;Allender;Proc. 30th Ann. Symp. on Foundations of Computer Science,1989
3. On uniformity within NC;Barrington;Proc. 3rd Ann. Conf. on Structure in Complexity Theory,1988
4. Constant depth reducibility;Chandra;SIAM J. Comput.,1984
5. Parity, circuits, and the polynomial-time hierarchy;Furst;Math. Systems Theory,1984
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Quantified Derandomization: How to Find Water in the Ocean;Foundations and Trends® in Theoretical Computer Science;2022
2. Bootstrapping results for threshold circuits “just beyond” known lower bounds;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
3. Circuit lower bounds from learning-theoretic approaches;Theoretical Computer Science;2018-07
4. Quantified derandomization of linear threshold circuits;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
5. Symmetric Functions Capture General Functions;Mathematical Foundations of Computer Science 2011;2011