ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
+Normal rank
@@ Property / cites work @@
+On the power of small-depth threshold circuits
@@ Property / cites work: On the power of small-depth threshold circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial closure and unambiguous product
@@ Property / cites work: Polynomial closure and unambiguous product / rank @@
+Normal rank
@@ Property / cites work @@
+Complete classifications for the communication complexity of regular languages
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank