Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079): Difference between revisions

@@ Property / cites work @@
+On the computational content of intuitionistic propositional proofs
+Normal rank
@@ Property / cites work @@
+Q3235339
@@ Property / cites work: Q3235339 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of cutting-plane proofs
@@ Property / cites work: On the complexity of cutting-plane proofs / rank @@
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for the pigeonhole principle
+Normal rank