A Downward Collapse within the Polynomial Hierarchy (Q4210153): Difference between revisions

@@ Property / cites work @@
+Limitations of the upward separation technique
@@ Property / cites work: Limitations of the upward separation technique / rank @@
+Normal rank
@@ Property / cites work @@
+Downward translations of equality
@@ Property / cites work: Downward translations of equality / rank @@
+Normal rank
@@ Property / cites work @@
+A relationship between difference hierarchies and relativized polynomial hierarchies
+Normal rank
@@ Property / cites work @@
+\(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
+Normal rank
@@ Property / cites work @@
+Tally languages and complexity classes
@@ Property / cites work: Tally languages and complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy II: Applications
@@ Property / cites work: The Boolean Hierarchy II: Applications / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
+Normal rank
@@ Property / cites work @@
+A downward translation in the polynomial hierarchy
+Normal rank
@@ Property / cites work @@
+Sparse sets in NP-P: EXPTIME versus NEXPTIME
@@ Property / cites work: Sparse sets in NP-P: EXPTIME versus NEXPTIME / rank @@
+Normal rank
@@ Property / cites work @@
+Defying upward and downward separation
@@ Property / cites work: Defying upward and downward separation / rank @@
+Normal rank
@@ Property / cites work @@
+Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
+Normal rank
@@ Property / cites work @@
+Easy sets and hard certificate schemes
@@ Property / cites work: Easy sets and hard certificate schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Computation times of NP sets of different densities
+Normal rank
@@ Property / cites work @@
+The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Some observations on the probabilistic algorithms and NP-hard problems
+Normal rank
@@ Property / cites work @@
+Relativized Polynomial Time Hierarchies Having Exactly <i>K</i> Levels
+Normal rank
@@ Property / cites work @@
+The difference and truth-table hierarchies for NP
@@ Property / cites work: The difference and truth-table hierarchies for NP / rank @@
+Normal rank
@@ Property / cites work @@
+Upward separation for FewP and related classes
@@ Property / cites work: Upward separation for FewP and related classes / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/s0097539796306474
+Normal rank
@@ Property / OpenAlex ID @@
+W2020903247
@@ Property / OpenAlex ID: W2020903247 / rank @@
+Normal rank