Author:
Haken Armin,Cook Stephen A.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference13 articles.
1. The monotone circuit complexity of Boolean functions;Alon;Combinatorica,1987
2. On a method for obtaining lower bounds for the complexity of individual monotone functions;Andreev;Dok. Akad. Nauk SSSR,1985
3. M. Bonet, T. Pitassi, R. Raz, Lower bounds for cutting planes proofs with small coefficients, Proc. Twenty-seventh Ann. ACM Symp. Theor. Comput, 1995, 575, 584
4. The complexity of finite functions;Boppana,1990
5. Many hard examples for resolution;Chvátal;J. Assoc. Comput. Mach.,1988
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cutting Planes Width and the Complexity of Graph Isomorphism Refutations;ACM Transactions on Computational Logic;2024-07-18
2. Random (log )-CNF Are Hard for Cutting Planes (Again);Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. On Protocols for Monotone Feasible Interpolation;ACM Transactions on Computation Theory;2023-03-31
4. Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes;Journal of the ACM;2022-06-27
5. Guest Column;ACM SIGACT News;2022-04-18