Journal of the ACM (JACM)
On the Structure of the Simulation Order of Proof Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Examples of hard tautologies in the propositional calculus
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Resolution and binary decision diagrams cannot simulate each other polynomially
Discrete Applied Mathematics - The renesse issue on satisfiability
Annals of Mathematics and Artificial Intelligence
On the proof complexity of deep inference
ACM Transactions on Computational Logic (TOCL)
On the polynomial transparency of resolution
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |