Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820): Difference between revisions

@@ Property / cites work @@
+\(\Sigma_ 1^ 1\)-formulae on finite structures
@@ Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+First-order definability on finite structures
@@ Property / cites work: First-order definability on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+Limits on the power of concurrent-write parallel machines
+Normal rank
@@ Property / cites work @@
+Optimal bounds for decision problems on the CRCW PRAM
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Q4728251
@@ Property / cites work: Q4728251 / rank @@
+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 @@
+Simulation of Parallel Random Access Machines by Circuits
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(90)90079-r
+Normal rank
@@ Property / OpenAlex ID @@
+W2152034968
@@ Property / OpenAlex ID: W2152034968 / rank @@
+Normal rank