| RUS ENG |
| Full version |
|
|
|
| SEMINARS |
|
Kolmogorov seminar on computational complexity and descriptive complexity
|
|||
|
|
|||
|
Linear lower bound for randomized communication complexity of disjointness (the proof by Braverman) A. Kozachinsky |
|||