|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
N. K. Vereshchagin, M. V. Dektiarev, “Half-duplex communication complexity with adversary can be less than the classical communication complexity”, Mat. Sb., 216:6 (2025), 3–45   ; Sb. Math., 216:6 (2025), 742–779   |
|
| Presentations in Math-Net.Ru |
| 1. |
Complexity of garden hoses
Dektyarev Michail
Kolmogorov seminar on computational complexity and descriptive complexity
April 22, 2013 16:45
|
|
|
