Examples of hard tautologies and worst-case complexity results for propositional proof systems

Authors:
Balakrishnan Krishnamurthy
Affiliations:
-
Venue:
Examples of hard tautologies and worst-case complexity results for propositional proof systems
Year:
1981

Citing 0
Cited 2

Examples of hard tautologies in the propositional calculus

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A lower bound on the size of resolution proofs of the Ramsey theorem

Information Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract