Author:
Istrate Gabriel,Crãciun Adrian
Publisher
Springer International Publishing
Reference25 articles.
1. Ben-Sasson, E., Nordström, J.: Understanding space in proof complexity: Separations and trade-offs via substitutions. In: Proceedings of the Second Symposium on Innovations in Computer Science, pp. 401–416 (2011)
2. Bonet, M., Buss, S., Pitassi, T.: Are there hard examples for Frege Systems? In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II, pp. 30–56 (1995)
3. Buss, S.: Polynomial size proofs of the propositional pigeonhole principle. Journal of Symbolic Logic 52(4), 916–927 (1987)
4. Chén, W., Zhang, W.: A direct construction of polynomial-size OBDD proof of pigeon hole problem. Information Processing Letters 109(10), 472–477 (2009)
5. Cook, S., Nguyen, P.: Logical foundations of proof complexity. Cambridge University Press (2010)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献