Seminars
RUS
ENG
JOURNALS
PEOPLE
ORGANISATIONS
CONFERENCES
SEMINARS
VIDEO LIBRARY
PACKAGE AMSBIB
JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
Calendar
Search
Add a seminar
RSS
Forthcoming seminars
Kolmogorov seminar on computational complexity and descriptive complexity
December 9, 2013
16:45–18:25
, Moscow
Linear lower bound for randomized communication complexity of disjointness (the proof by Braverman)
A. Kozachinsky
Number of views:
This page:
202
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2024
Contact us: Terms of Use
Registration to the website Logotypes