منابع مشابه
Nondeterministic Communication Complexity with Help and Graph Functions
We define nondeterministic communication complexity in the model of communication complexity with help of Babai, Hayes and Kimmel. We use it to prove logarithmic lower bounds on the NOF communication complexity of explicit graph functions, which are complementary to the bounds proved by Beame, David, Pitassi and Woelfel.
متن کاملSlice monogenic functions
In this paper we offer a new definition of monogenicity for functions defined on R with values in the Clifford algebra Rn following an idea inspired by the recent papers [6], [7]. This new class of monogenic functions contains the polynomials (and, more in general, power series) with coefficients in the Clifford algebra Rn. We will prove a Cauchy integral formula as well as some of its conseque...
متن کاملSlice-Based Information Flow Graph
We, in this paper, try to represent information flow of program on the basis of slices. It is referred to slice-based information flow graph(SIFG). SIFG captures the information flow among data tokens. We can find the elementary characteristics of the information flow of program by using SIFG and increase the understanding about program.
متن کاملGraph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint union of complete graphs. Erd˝ os and, independently, Albertson et al., proved that every graph of maximum degree at most 3 has a 2-subcoloring. We point out that this fact is best possible with respect to degree constr...
متن کاملGraph Clustering : Complexity , Sequential and
In this thesis we study graph clustering on two well known families of graphs that arise in many applications, namely bipartite and chordal graphs. We study two speci c types of clustering problems. On the one hand we seek a partition of the vertex set of a graph into a bounded number of sets so that a prespeci ed function determined by the diameters of the induced subgraphs is minimized. On th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2003
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-002-1068-0