Does Advice Help to Prove Propositional Tautologies? (Q3637158): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1533547276
@@ Property / OpenAlex ID: W1533547276 / rank @@
+Normal rank
@@ Property / cites work @@
+Logarithmic advice classes
@@ Property / cites work: Logarithmic advice classes / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Instance Complexity and Proof Systems with Advice
+Normal rank
@@ Property / cites work @@
+A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
+Normal rank
@@ Property / cites work @@
+Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Optimal proof systems imply complete sets for promise classes
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank