A uniform approach to obtain diagonal sets in complexity classes (Q1164414): Difference between revisions

@@ 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/0304-3975(82)90114-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2082636129
@@ Property / OpenAlex ID: W2082636129 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4160434
@@ Property / cites work: Q4160434 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on structure and looking back applied to the relative complexity of computable functions
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of sets in NP and other complexity classes
+Normal rank
@@ Property / cites work @@
+Strong nondeterministic polynomial-time reducibilities
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1164414