On the Non-deterministic Communication Complexity of Regular Languages

DOI10.1007/978-3-540-85780-8_7zbMath1161.68597OpenAlexW1607180512MaRDI QIDQ3533002

Anil Ada

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70)

Related Items

On the Non-deterministic Communication Complexity of Regular Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power of small-depth threshold circuits
• Expressing combinatorial optimization problems by linear programs
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Complete classifications for the communication complexity of regular languages
• Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
• On the Non-deterministic Communication Complexity of Regular Languages
• Polynomial closure and unambiguous product
• Communication Complexity