objective(s) erythropoietin has been shown to exert neuroprotective effects in a variety of cns injury models. elevation of serum s100β, as a glial damage marker and myelin basic protein (mbp) has been reported to occur in acute carbon monoxide (co) poisoning. the aim of this study was to evaluate the effect of erythropoietin (epo) on serum s100β and mbp levels after co poisoning in rats. mater...

We study the complexity of telling whether a set of bit-vectors represents the set of all satisfying truth assignments of a Boolean expression of a certain type. We show that the problem is coNP-complete when the expression is required to be in conjunctive normal form with three literals per clause (3CNF). We also prove a dichotomy theorem analogous to the classical one by Schaefer, stating tha...

Bennett and Gill (1981) proved that P 6= NP relative to a random oracle A, or in other words, that the set O[P=NP] = {A | P = NP} has Lebesgue measure 0. In contrast, we show that O[P=NP] has Hausdorff dimension 1. This follows from a much more general theorem: if there is a relativizable and paddable oracle construction for a complexity-theoretic statement Φ, then the set of oracles relative t...

When answering queries in the presence of ontologies, adopting the closed world assumption for some predicates easily results in intractability. We analyze this situation on the level of individual ontologies formulated in the description logics DLLite and EL and show that in all cases where answering conjunctive queries (CQs) with (open and) closed predicates is tractable, it coincides with an...

In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a size bounded by a polynomial in a specified parameter (or, in short: do not have a polynomial kernel); these results are assuming the validity of certain complexity theoretic assumptions. We build upon recent results ...

Compressibility regards the reduction the length of the input, or of some other parameter, preserving the solution. Any 3-SAT instance on N variables can be represented by O(N) bits. [4] proved that the instance length in general cannot be compressed to O(N3−!) bits under the assumption NP !⊆ coNP/poly, which implies that the polynomial hierarchy collapses. This note initiates and puts forward ...