Relations between diagonalization, proof systems, and complexity gaps (Q1254105): Difference between revisions

@@ Property / author @@
-Juris Hartmanis
@@ Property / author: Juris Hartmanis / rank @@
-Normal rank
@@ Property / author @@
+Juris Hartmanis
@@ Property / author: Juris Hartmanis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2036722394
@@ Property / OpenAlex ID: W2036722394 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity and the Existence of Complexity Gaps
+Normal rank
@@ Property / cites work @@
+Theory of Provable Recursive Functions
@@ Property / cites work: Theory of Provable Recursive Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of One-Tape Turing Machine Computations
+Normal rank
@@ Property / cites work @@
+An Overview of the Theory of Computational Complexity
+Normal rank
@@ Property / cites work @@
+Two-Tape Simulation of Multitape Turing Machines
@@ Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization Among Provably Equivalent Programs
@@ Property / cites work: Optimization Among Provably Equivalent Programs / rank @@
+Normal rank