Publisher
Springer International Publishing
Reference24 articles.
1. M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, A. Wigderson, Space complexity in propositional calculus. SIAM J. Comput. 31(4), 1184–1211 (2002)
2. P. Beame, T. Pitassi, Simplified and improved resolution lower bounds, in 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 274–282 (1996)
3. E. Ben-Sasson, R. Impagliazzo, A. Wigderson, Near-optimal separation of tree-like and general resolution. Combinatorica 24(4), 585–603 (2004)
4. E. Ben-Sasson, J. Nordström, Short proofs may be spacious: an optimal separation of space and length in resolution, in Proceedings of 49th FOCS Conference, pp. 709–718 (2008)
5. E. Ben-Sasson, A. Wigderson, Short proofs are narrow—resolution made simple. J. ACM 48(2), 149–169 (2001)