Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Andras Hajnal"'
Publikováno v:
STOC
We prove t(n log n) bounds for the deterministic 2-way communication complexity of the graph properties CONNECTIVITY, s-t-CONNECTIVITY and BIPARTITENESS (for arbitrary partitions of the variables into two sets of equal size). The proofs are based on