Classification of the index sets of low \([n]^ p\) and high \([n]^ p\) (Q1337641): Difference between revisions

@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy for nondeterministic time complexity
@@ Property / cites work: A hierarchy for nondeterministic time complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity, speedable and levelable sets
+Normal rank
@@ Property / cites work @@
+Q3819052
@@ Property / cites work: Q3819052 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4134973
@@ Property / cites work: Q4134973 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707407
@@ Property / cites work: Q3707407 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02945518
+Normal rank
@@ Property / OpenAlex ID @@
+W2051935005
@@ Property / OpenAlex ID: W2051935005 / rank @@
+Normal rank