Author:
Atserias Albert,Galesi Nicola,Gavaldá Ricard
Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. M. Ajtai. The complexity of the pigeonhole principle. Combinatorica, 14, pp. 417–433, 1994.
2. M. Ajtai, J. Komlós, E. Szemer edi. An O(n log n) sorting network. Combinatorica, 3(1), pp. 1–19, 1983.
3. N. Alon, R. B. Boppana. The monotone circuit complexity of boolean functions. Combinatorica, 7, pp. 1–22, 1987.
4. P. Beame, R. Impagliazzo, J. KrajÍček, T. Pitassi, P. Pudlák, A. Woods. Exponential lower bounds for the Pigeon Hole Principle. STOC’92, pp. 200–220, 1992.
5. P. Beame, T. Pitassi. Propositional Proof Complexity: Past, Present and Future. Bulletin of the European Association for Theoretical Computer Science, 65, 1998.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Proof Complexity of Monotone Branching Programs;Revolutions and Revelations in Computability;2022
2. From positive and intuitionistic bounded arithmetic to monotone proof complexity;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05