On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507): Difference between revisions

@@ Property / cites work @@
+Q4321931
@@ Property / cites work: Q4321931 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Complexity classes without machines: on complete languages for UP
+Normal rank
@@ Property / cites work @@
+Q3676130
@@ Property / cites work: Q3676130 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258579
@@ Property / cites work: Q4258579 / rank @@
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank
@@ Property / cites work @@
+On the structure of sets in NP and other complexity classes
+Normal rank
@@ Property / cites work @@
+Q4251070
@@ Property / cites work: Q4251070 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4381398
@@ Property / cites work: Q4381398 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Recursively Enumerable Sets and Their Decision Problems
+Normal rank