We consider the discrete, time-varying broadcast channel with memory, under the assumption that the channel states belong to a set of nite cardinality. We begin with the de nition...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
We define the concept of a logic frame, which extends the concept stract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the...