ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the power of small-depth threshold circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial closure and unambiguous product / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complete classifications for the communication complexity of regular languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expressing combinatorial optimization problems by linear programs / rank | |||
Normal rank | |||
Latest revision as of 03:32, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES |
scientific article |
Statements
ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (English)
0 references
6 September 2010
0 references
communication complexity
0 references
regular languages
0 references
algebraic automata theory
0 references
0 references
