Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Ajtai, M.:
$\Sigma_1^1$
-formulae on finite structures. Annals of Pure and Applied Logic 24, 1–48 (1983)
2. Ajtai, M.: The Complexity of the Pigeonhole Principle. Combinatorica 14(4), 417–433 (1994)
3. Beame, P., et al.: Exponential Lower Bound for the Pigeonhole Principle (extended abstract). In: Proc. ACM Symp. on Theory of Computing, pp. 200–220. ACM Press, New York (1992)
4. Furst, M., Saxe, J.B., Sipser, M.: Parity, Circuits and the Polynomial Time Hierarchy. Mathematical Systems Theory 17, 13–17 (1984)
5. Gentzen, G.: Unterschungen über das logische Schliessen. Mathematische Zeitschrift 39, 176–210, 405–431 (1934)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Proof Complexity;2019-03-28
2. The Nature of Proof Complexity;Proof Complexity;2019-03-28
3. Model Theory and Lower Bounds;Proof Complexity;2019-03-28
4. Hard Tautologies;Proof Complexity;2019-03-28
5. Index;Proof Complexity;2019-03-28