Author:
Buss Samuel R.,Johnson Alan S.
Reference22 articles.
1. The relative complexity of NP search problems;Beame;Journal of Computer and System Sciences,1998
2. Lower bounds on Hilbert’s Nullstellensatz and propositional proofs;Beame;Proceedings of the London Mathematical Society,1996
3. P. Beame, R. Impagliazzo, J. Krajíček, T. Pitassi, P. Pudlák, A. Woods, Exponential lower bounds for the pigeonhole principle, in: Proceedings of the 24-th Annual ACM Symposium on Theory of Computing, 1992, pp. 200–220.
4. An exponential separation between the parity principle and the pigeonhole principle;Beame;Annals of Pure and Applied Logic,1996
5. Separation results for the size of constant-depth propositional proofs;Beckmann;Annals of Pure and Applied Logic,2005
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献