On the power of deterministic reductions to C=P (Q4032933): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A relationship between difference hierarchies and relativized polynomial hierarchies
+Normal rank
@@ Property / cites work @@
+PP is closed under intersection
@@ Property / cites work: PP is closed under intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Q3974853
@@ Property / cites work: Q3974853 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3773331
@@ Property / cites work: Q3773331 / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy I: Structural Properties
@@ Property / cites work: The Boolean Hierarchy I: Structural Properties / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
+Normal rank
@@ Property / cites work @@
+The strong exponential hierarchy collapses
@@ Property / cites work: The strong exponential hierarchy collapses / rank @@
+Normal rank
@@ Property / cites work @@
+The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+BPP and the polynomial hierarchy
@@ Property / cites work: BPP and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized theorems on relationships among reducibility notions to certain complexity classes
+Normal rank
@@ Property / cites work @@
+Q4035673
@@ Property / cites work: Q4035673 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ Property / cites work @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank