An oracle separating conjectures about incompleteness in the finite domain (Q2290649): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2020.01.003
@@ Property / DOI: 10.1016/j.tcs.2020.01.003 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2020.01.003
+Normal rank
@@ Property / OpenAlex ID @@
+W3000303691
@@ Property / OpenAlex ID: W3000303691 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic functions and the existence of optimal proof systems
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+NP-Completeness, Proof Systems, and Disjoint NP-Pairs.
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+Cryptocomplexity and NP-completeness
@@ Property / cites work: Cryptocomplexity and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Measures for Public-Key Cryptosystems
@@ Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint NP-Pairs
@@ Property / cites work: Disjoint NP-Pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes without machines: on complete languages for UP
+Normal rank
@@ Property / cites work @@
+Q4472459
@@ Property / cites work: Q4472459 / rank @@
+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
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4885911
@@ Property / cites work: Q4885911 / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Foundations of Mathematics and Computational Complexity
+Normal rank
@@ Property / cites work @@
+INCOMPLETENESS IN THE FINITE DOMAIN
@@ Property / cites work: INCOMPLETENESS IN THE FINITE DOMAIN / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2020.01.003
@@ Property / DOI: 10.1016/J.TCS.2020.01.003 / rank @@
+Normal rank