Electronic Colloquium on Computational Complexity the Mm Obius Function, Variations Ranks, and (n){bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem
نویسندگان
چکیده
We prove that the modular communication complexity of the undi-rected graph connectivity problem UCONN equals (n), in contrast to the well{ known (n log n) bound in the deterministic case, and to the (n log log n) lower bound in the nondeterministic case, recently proved by Raz and Spieker. We obtain our result by combining MM obius function techniques due to Lovasz and Saxe with rank and projection reduction arguments. subject "MAIL ME CLEAR", body "pub/eccc/ftpmail.txt"
منابع مشابه
Streaming bounds from difference ramification
In graph streaming a graph with n vertices and m edges is presented as a read-once stream of edges. We obtain an Ω(n logn) lower bound on the space required to decide graph connectivity. This improves the known bounds of Ω(n) for undirected and Ω(m) for sparse directed graphs. We develop a method of ramifying inessential differences into significant differences. For graph connectivity, this yie...
متن کاملLower bounds on the Deterministic and Quantum Communication Complexity of HAMna
Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on at most a bits? Let 0 ≤ a ≤ n − 1. We show that any deterministic protocol, as well as any error-free quantum protocol (C∗ version), for this problem requires at least n− 2 bits of communication. We show the same bounds for the problem of determining if two strings differ in exactly a bits. We als...
متن کاملSome new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملLower Bounds for Circuits with Few Modular Gates using Exponential Sums
AC 0 circuits of size n log n augmented with log n MODm gates, for every odd integer m and any sufficiently small . As a consequence, for every odd integer m, we obtain a pseudorandom generator, based on the MOD2 function, for circuits of size S containing log S MODm gates. Our results are based on recent bounds of exponential sums that were previously introduced for proving lower bounds for MA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994