Sciweavers

21984 search results - page 436 / 4397
» C
Sort
View
ECCC
2006
88views more  ECCC 2006»
15 years 7 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
APPROX
2006
Springer
100views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Local Testability of Tensor Products of LDPC Codes
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
Irit Dinur, Madhu Sudan, Avi Wigderson
APAL
2010
69views more  APAL 2010»
15 years 7 months ago
Cardinal sequences of LCS spaces under GCH
Let C() denote the class of all cardinal sequences of length associated with compact scattered spaces. Also put C() = {f C() : f(0) = = min[f() : < ]}. If is a cardinal an...
Juan Carlos Martinez, Lajos Soukup
AML
2008
54views more  AML 2008»
15 years 7 months ago
Potential continuity of colorings
Abstract. We say that a coloring c : []n 2 is continuous if it is continuous with respect to some second countable topology on . A coloring c is potentially continuous if it is co...
Stefan Geschke
DCC
2010
IEEE
15 years 7 months ago
The maximum size of a partial 3-spread in a finite vector space over GF(2)
Let n 3 be an integer, let Vn(2) denote the vector space of dimension n over GF(2), and let c be the least residue of n modulo 3. We prove that the maximum number of 3-dimensional...
Saad El-Zanati, H. Jordon, G. F. Seelinger, Papa S...