Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies;ACM Transactions on Computational Logic;2016-11-15
2. Paris-Harrington Tautologies;2011 IEEE 26th Annual Conference on Computational Complexity;2011-06
3. Cutting planes, connectivity, and threshold logic;Archive for Mathematical Logic;1996-01