Author:
Alon Noga,Karchmer Mauricio,Wigderson Avi
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Reference4 articles.
1. Decomposition of graphs and monotone formula size of homogeneous functions
2. P. Erdös, J. H. Spencer, Probabilistic methods in combinatorics, Academic Press [A subsidiary of Harcourt Brace Jovanovich, Publishers], New York-London, 1974, 106–52:28950308.05001
3. Graph-theoretic arguments in low-level complexity
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Efficient Construction of Rigid Matrices Using an NP Oracle;SIAM Journal on Computing;2022-03-07
2. Improved bounds for the sunflower lemma;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
3. Efficient Construction of Rigid Matrices Using an NP Oracle;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11
4. Separating OR, SUM, and XOR circuits;Journal of Computer and System Sciences;2016-08
5. Cancellation-free circuits in unbounded and bounded depth;Theoretical Computer Science;2015-07