On polynomially D verbose sets (Q5048933): Difference between revisions

@@ Property / DOI @@
-.1007/BFb0023468
@@ Property / DOI: 10.1007/BFb0023468 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bfb0023468
+Normal rank
@@ Property / OpenAlex ID @@
+W1517540643
@@ Property / OpenAlex ID: W1517540643 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2914641
@@ Property / cites work: Q2914641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281521
@@ Property / cites work: Q4281521 / rank @@
+Normal rank
@@ Property / cites work @@
+Semirecursive Sets and Positive Reducibility
@@ Property / cites work: Semirecursive Sets and Positive Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of Beigel's cardinality conjecture
@@ Property / cites work: A proof of Beigel's cardinality conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
+Normal rank
@@ Property / DOI @@
+.1007/BFB0023468
@@ Property / DOI: 10.1007/BFB0023468 / rank @@
+Normal rank