Publisher
Springer International Publishing
Reference41 articles.
1. Ajtai, M. (1988). The complexity of the pigeonhole principle. In Proceedings of the 29th Annual IEEE Symposium on the Foundations of Computer Science (pp. 346–355).
2. Anderson, A. R., & Belnap, N. D. (1975). Entailment (Vol. 1). Princeton, NJ: Princeton University Press.
3. Beame, P., Impagliazzo, R., Krajíc̆ek, J., Pitassi, T., Pudlák, P., & Woods, A. (1992). Exponential lower bounds for the pigeonhole principle. In Proceedings of the 24th Annual ACM Symposium on theory of computing (pp. 200–220).
4. Bellantoni, S., Pitassi, T., & Urquhart, A. (1992). Approximation and small-depth Frege proofs. SIAM Journal of Computing, 21, 1161–1179.
5. Białynicki-Birula, A., & Rasiowa, H. (1957). On the representation of quasi-Boolean algebras. Bulletin de l’académie polonaise des sciences, 5, 259–261.