Author:
Aisenberg James,Bonet Maria Luisa,Buss Sam,Crãciun Adrian,Istrate Gabriel
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Aisenberg, J., Bonet, M.L., Buss, S.R.: Quasi-polynomial size Frege proofs of Frankl’s theorem on the trace of finite sets (201?) (to appear in Journal of Symbolic Logic)
2. Bonet, M.L., Buss, S.R., Pitassi, T.: Are there hard examples for Frege systems? In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II, pp. 30–56. Birkhäuser, Boston (1995)
3. Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. Journal of Symbolic Logic 52, 916–927 (1987)
4. Buss, S.R.: Propositional proof complexity: An introduction. In: Berger, U., Schwichtenberg, H. (eds.) Computational Logic, pp. 127–178. Springer, Berlin (1999)
5. Buss, S.R.: Towards NP-P via proof complexity and proof search. Annals of Pure and Applied Logic 163(9), 1163–1182 (2012)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献