Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The independence of the modulo p counting principles
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Hard examples for bounded depth frege
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Hard examples for the bounded depth Frege proof system
Computational Complexity
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |