Perceptrons, PP, and the polynomial hierarchy (Q1346615): Difference between revisions

@@ Property / cites work @@
+Depth reduction for circuits of unbounded fan-in
@@ Property / cites work: Depth reduction for circuits of unbounded fan-in / rank @@
+Normal rank
@@ Property / cites work @@
+The expressive power of voting polynomials
@@ Property / cites work: The expressive power of voting polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+On ACC
@@ Property / cites work: On ACC / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic polynomial time is closed under parity reductions
+Normal rank
@@ Property / cites work @@
+PP is closed under intersection
@@ Property / cites work: PP is closed under intersection / rank @@
+Normal rank
@@ Property / cites work @@
+On truth-table reducibility to SAT
@@ Property / cites work: On truth-table reducibility to SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Q5543516
@@ Property / cites work: Q5543516 / rank @@
+Normal rank
@@ Property / cites work @@
+Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points)
+Normal rank
@@ Property / cites work @@
+SeparatingPH fromPP by relativization
@@ Property / cites work: SeparatingPH fromPP by relativization / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Q5534403
@@ Property / cites work: Q5534403 / rank @@
+Normal rank
@@ Property / cites work @@
+A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
+Normal rank
@@ Property / cites work @@
+Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
+Normal rank