Author:
Beckmann Arnold,Buss Samuel R.
Reference25 articles.
1. Miklós Ajtai, The complexity of the pigeonhole principle, in: Proceedings of the 29-th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 346–355
2. Lower bounds for the weak pigeonhole principle and random formulas beyond resolution;Atersias;Information and Computation,2002
3. An exponential separation between the parity principle and the pigeonhole principle;Beame;Annals of Pure and Applied Logic,1996
4. Lower bounds on Hilbert’s Nullstellensatz and propositional proofs;Beame;Proceedings of the London Mathematical Society,1996
5. Arnold Beckmann, Separating fragments of bounded arithmetic, Ph.D. Thesis, Westfälishe Wilhelms Universität Münster, 1996
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献