Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159): Difference between revisions

@@ Property / cites work @@
+Limits on the power of concurrent-write parallel machines
+Normal rank
@@ Property / cites work @@
+Harmonic Analysis of Polynomial Threshold Functions
+Normal rank
@@ Property / cites work @@
+Properties of complexity measures for PRAMs and WRAMs
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+One-way functions and the nonisomorphism of NP-complete sets
+Normal rank
@@ Property / cites work @@
+Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
+Normal rank
@@ Property / cites work @@
+Q5595902
@@ Property / cites work: Q5595902 / rank @@
+Normal rank
@@ Property / cites work @@
+CREW PRAM<scp>s</scp> and Decision Trees
@@ Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+On recognizing graph properties from adjacency matrices
+Normal rank
@@ Property / cites work @@
+A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
+Normal rank
@@ Property / cites work @@
+On Parallel Searching
@@ Property / cites work: On Parallel Searching / rank @@
+Normal rank
@@ Property / cites work @@
+Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank