Author:
H�stad J.,Jukna S.,Pudl�k P.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference15 articles.
1. M. Ajtai, 111-1 on finite structures.Ann. Pure and Appl. Logic 24 (1983), 1?48.
2. A. Borodin, A. Razborov andR. Smolensky, On lower bounds for reak-k-times branching programs.Computational Complexity 3 (1993), 1?18.
3. P. Erd�s andR. Rado, Intersection theorems for systems of sets.J. London Math. Soc. 35 (1960), 85?90.
4. M. Furst, J. Saxe andM. Sipser, Parity, circuits and the polynomial time hierarchy.Math. Systems Theory 17 (1984), 13?27.
5. J. H�stad,Almost Optimal Lower Bounds for Small Depth Circuits. Advances in Computing Research, ed.S. Micali, Vol 5 (1989), 143?170.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A generalization of diversity for intersecting families;European Journal of Combinatorics;2024-12
2. Depth-3 circuits for inner product;Information and Computation;2024-10
3. Top-Down Lower Bounds for Depth-Four Circuits;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. On the Information Capacity of Nearest Neighbor Representations;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
5. Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC°;Theory of Computing;2023