Speedup for natural problems and noncomputability (Q620964): Difference between revisions

@@ Property / cites work @@
+A Machine-Independent Theory of the Complexity of Recursive Functions
+Normal rank
@@ Property / cites work @@
+On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+On the Asymptotic Complexity of Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Q3113771
@@ Property / cites work: Q3113771 / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
+Normal rank
@@ Property / cites work @@
+Q4472459
@@ Property / cites work: Q4472459 / 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 @@
+Computational speed-up by effective operators
@@ Property / cites work: Computational speed-up by effective operators / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396633
@@ Property / cites work: Q3396633 / rank @@
+Normal rank
@@ Property / cites work @@
+How to multiply matrices faster
@@ Property / cites work: How to multiply matrices faster / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of complexity sequences
@@ Property / cites work: A characterization of complexity sequences / rank @@
+Normal rank