Nondeterministic Instance Complexity and Proof Systems with Advice (Q3618578): Difference between revisions

@@ Property / OpenAlex ID @@
+W1567771348
@@ Property / OpenAlex ID: W1567771348 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59903686
@@ Property / Wikidata QID: Q59903686 / rank @@
+Normal rank
@@ Property / cites work @@
+Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>
+Normal rank
@@ Property / cites work @@
+A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
+Normal rank
@@ Property / cites work @@
+Instance complexity
@@ Property / cites work: Instance complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501542
@@ Property / cites work: Q4501542 / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank
@@ Property / cites work @@
+Resource-Bounded Kolmogorov Complexity Revisited
@@ Property / cites work: Resource-Bounded Kolmogorov Complexity Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418680
@@ Property / cites work: Q4418680 / rank @@
+Normal rank
@@ Property / cites work @@
+Competing provers yield improved Karp-Lipton collapse results
+Normal rank