Author:
Das Anupam,Delkos Avgerinos
Publisher
Springer International Publishing
Reference23 articles.
1. Ajtai, M., Gurevich, Y.: Monotone versus positive. J. ACM 34(4), 1004–1015 (1987). https://doi.org/10.1145/31846.31852
2. Lecture Notes in Computer Science;A Atserias,2000
3. Atserias, A., Galesi, N., Pudlák, P.: Monotone simulations of non-monotone proofs. J. Comput. Syst. Sci. 65(4), 626–638 (2002). https://doi.org/10.1016/S0022-0000(02)00020-X
4. Beame, P., Impagliazzo, R., Krajícek, J., Pitassi, T., Pudlák, P., Woods, A.R.: Exponential lower bounds for the pigeonhole principle. In: 24th Annual ACM STOC (1992). https://doi.org/10.1145/129712.129733
5. Buss, S., Das, A., Knop, A.: Proof complexity of systems of (non-deterministic) decision trees and branching programs. In: 28th Annual CSL. LIPIcs (2020). http://arxiv.org/abs/1910.08503