Circuits over PP and PL (Q1567408): Difference between revisions

@@ Property / cites work @@
+When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one
+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 @@
+Parallel computation for well-endowed rings and space-bounded probabilistic machines
+Normal rank
@@ Property / cites work @@
+The Parallel Evaluation of General Arithmetic Expressions
+Normal rank
@@ Property / cites work @@
+Q3140633
@@ Property / cites work: Q3140633 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Parallel Algorithm for Formula Evaluation
+Normal rank
@@ Property / cites work @@
+PP is closed under truth-table reductions
@@ Property / cites work: PP is closed under truth-table reductions / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+NP trees and Carnap's modal logic
@@ Property / cites work: NP trees and Carnap's modal logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q3735080
@@ Property / cites work: Q3735080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5180413
@@ Property / cites work: Q5180413 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228457
@@ Property / cites work: Q4228457 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded hierarchies and probabilistic computations
+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 @@
+Relativized circuit complexity
@@ Property / cites work: Relativized circuit complexity / rank @@
+Normal rank