On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/inco.2001.3040
+Normal rank
@@ Property / OpenAlex ID @@
+W2072453354
@@ Property / OpenAlex ID: W2072453354 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Exact lower time bounds for computing Boolean functions on CREW PRAMs
+Normal rank
@@ Property / cites work @@
+Q4293543
@@ Property / cites work: Q4293543 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4337605
@@ Property / cites work: Q4337605 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228510
@@ Property / cites work: Q4228510 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+On quantum and probabilistic communication
@@ Property / cites work: On quantum and probabilistic communication / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity
@@ Property / cites work: Communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3768423
@@ Property / cites work: Q3768423 / rank @@
+Normal rank