Author:
Goldmann Mikael,Håstad Johan
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference12 articles.
1. Σ11-formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983
2. The monotone circuit complexity of boolean functions;Alon;Combinatorica,1987
3. On a method for obtaining lower bounds for the complexity of individual monotone functions;Andreev;Dokl. Akad. Nauk. SSSR,1985
4. Parity circuits, and the polynomial time hierarchy;Furst;Math. Systems Theory,1984
5. Computational Limitations of Small-Depth Circuits;Håstad,1986
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. KRW Composition Theorems via Lifting;computational complexity;2024-04-29
2. On Protocols for Monotone Feasible Interpolation;ACM Transactions on Computation Theory;2023-03-31
3. Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC°;Theory of Computing;2023
4. Guest Column;ACM SIGACT News;2022-04-18
5. KRW Composition Theorems via Lifting;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11