Nonlevelable sets and immune sets in the accepting density hierarchy inNP (Q3711750): Difference between revisions

@@ Property / cites work @@
+On counting problems and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+On complexity properties of recursively enumerable sets
+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 @@
+Hard-core theorems for complexity classes
@@ Property / cites work: Hard-core theorems for complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+Oracle-dependent properties of the lattice of NP sets
+Normal rank
@@ Property / cites work @@
+Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
+Normal rank
@@ Property / cites work @@
+Completeness, Approximation and Density
@@ Property / cites work: Completeness, Approximation and Density / rank @@
+Normal rank
@@ Property / cites work @@
+On Circuit-Size Complexity and the Low Hierarchy in NP
+Normal rank
@@ Property / cites work @@
+BPP and the polynomial hierarchy
@@ Property / cites work: BPP and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+On Reducibility to Complex or Sparse Sets
@@ Property / cites work: On Reducibility to Complex or Sparse Sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the Accepting Density Hierarchy in NP
@@ Property / cites work: On the Accepting Density Hierarchy in NP / rank @@
+Normal rank
@@ Property / cites work @@
+A classification of complexity core lattices
@@ Property / cites work: A classification of complexity core lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Approximations and Polynomially Levelable Sets
+Normal rank
@@ Property / cites work @@
+Q3219763
@@ Property / cites work: Q3219763 / rank @@
+Normal rank
@@ Property / cites work @@
+Relativized Questions Involving Probabilistic Algorithms
+Normal rank
@@ Property / cites work @@
+A low and a high hierarchy within NP
@@ Property / cites work: A low and a high hierarchy within NP / rank @@
+Normal rank
@@ Property / cites work @@
+Immunity, Relativizations, and Nondeterminism
@@ Property / cites work: Immunity, Relativizations, and Nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+Separating Nondeterministic Time Complexity Classes
+Normal rank
@@ Property / cites work @@
+Computational complexity, speedable and levelable sets
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01699469
+Normal rank
@@ Property / OpenAlex ID @@
+W2092583861
@@ Property / OpenAlex ID: W2092583861 / rank @@
+Normal rank