Simplified Lower Bounds for Propositional Proofs
暂无分享,去创建一个
[1] J. Neumann. Zur Hilbertschen Beweistheorie , 1927 .
[2] Russell Impagliazzo,et al. Exponential lower bounds for the pigeonhole principle , 1992, STOC '92.
[3] Gottlob Frege,et al. Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens , 1879 .
[4] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[5] Miklós Ajtai,et al. The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.