Lower bounds on blocking sets
نویسندگان
چکیده
منابع مشابه
Sparse Selfreducible Sets and Nonuniform Lower Bounds
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study th...
متن کاملPartitioning Α–large Sets: Some Lower Bounds
Let α → (β)m denote the property: if A is an α–large set of natural numbers and [A]r is partitioned into m parts, then there exists a β– large subset of A which is homogeneous for this partition. Here the notion of largeness is in the sense of the so–called Hardy hierarchy. We give a lower bound for α in terms of β,m, r for some specific β. This paper is a continuation of our work [2] and [3] o...
متن کاملLower Bounds on the Size of Test Data Sets
Practically speaking, how small can a test suite be and still be of value? In the context of temporal graph-theoretic abductive validation, the answer to this question is very language-dependent. Seemingly trivial variations in a language can have a signiicant impact on how large a test suite must be. This paper is hence a cautionary note to those who invent languages and ontologies without exp...
متن کاملLower Bounds for Wide-Sense Non-blocking Clos Network
The 3-stage Clos network is generally considered the most basic multistage interconnecting network (MIN). The nonblocking property of such network has been extensively studied in the past. However, there are only a few lower bound results regarding wide-sense nonblocking. We show that in the classical circuit switching environment, to guarantee wide-sense nonblocking for large r, 2n− 1 center s...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1985
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1985.118.303