Threshold functions for extension statements
نویسندگان
چکیده
منابع مشابه
Threshold functions for
Let H be a graph on h vertices, and let G be a graph on n vertices. An H-factor of G is a spanning subgraph of G consisting of n=h vertex disjoint copies of H. The fractional arboricity of H is a(H) = maxf jE 0 j jV 0 j?1 g, where the maximum is taken over all subgraphs (V 0 ; E 0) of H with jV 0 j > 1. Let (H) denote the minimum degree of a vertex of H. It is shown that if (H) < a(H) then n ?1...
متن کاملThreshold Functions for H-factors
Let H be a graph on h vertices, and let G be a graph on n vertices. An H-factor of G is a spanning subgraph of G consisting of n/h vertex disjoint copies of H. The fractional arboricity of H is a(H) = max{ |E ′| |V ′|−1}, where the maximum is taken over all subgraphs (V ′, E′) of H with |V ′| > 1. Let δ(H) denote the minimum degree of a vertex of H. It is shown that if δ(H) < a(H) then n−1/a(H)...
متن کاملRestructuring programs by tucking statements into functions
Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by decomposing large functions into small functions. Tuck consists of three steps: Wedge, Split, and Fold. A wedge—a subset of statements in a slice—contains computations that are related and that may create a meaningful ...
متن کاملDecomposition of threshold functions into bounded fan-in threshold functions
Article history: Received 31 October 2007 Revised 3 March 2011 Available online 10 April 2013
متن کاملPolynomial Threshold Functions and Boolean Threshold Circuits
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1990
ISSN: 0097-3165
DOI: 10.1016/0097-3165(90)90061-z