Some 250 number-focused news articles have been analyzed for the prevalence of statistically-related content. Ninety-five factors were analyzed for each story. These included (a) elements of study design (controlled, control for related factors, longitudinal, cohort, experi-ment and random assignment), (b) statistical measures (ranging from simple counts and percentages to confidence intervals ...

We prove a number of results around kernelization of problems parameterized by the size of a given vertex cover of the input graph. We provide three sets of simple general conditions characterizing problems admitting kernels of polynomial size. Our characterizations not only give generic explanations for the existence of many known polynomial kernels for problems like q-Coloring, Odd Cycle Tran...

A common thread in the social sciences is to identify the “most desirable” elements of a set of alternatives according to some binary dominance relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Brandt and Fischer [BF08] proved that MCu-MEMBER, the problem of deciding whether an alternative is contained in some inclusion-minimal upward c...

Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this self-reducibility structure of a set can be used to access easily all information contained in the set, if its information content is small. It is shown that P c...

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP∩coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite some time. Our result implies that a polynomial time algorithm for the problem is more likely than it being NP-complete unless P = NP. keywords: Bicliques, Polyn...

This paper reflects a challenging applied research task to stimulate, at global level, exchange of statistical measures and knowledge through innovative Geovisual Analytics techniques. Establish progress initiatives at international and regional (sub-national) levels for measuring and collaborating, through statistical indicators, economic, social and environmental developments and to engage bo...

It is known that most of the oxygen-linked carbamate which is formed in normal adult human hemoglobin (Hb A) is confined to the /3 subunits rather than to the LY subunits. In order to find out if similar differences exist in the isolated protomers of Hb A we have measured the effect of various pressures of carbon dioxide (pcoJ on the oxygen affinity in the following heme pigments: isolated (Y a...

It is known [BHZ87] that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. [LFKN92] have shown that #SAT, the #P-complete function that outputs the number of satisfying assignments of a Boolean formula, can be computed by a linear-round interactive protocol. As a consequence, the coNP-complete set SAT...

We introduce and investigate a new type of reductions between counting problems, which we call subtractive reductions. We show that the main counting complexity classes #P, #NP, as well as all higher counting complexity classes # · kP, k 2, are closed under subtractive reductions. We then pursue problems that are complete for these classes via subtractive reductions. We focus on the class #NP (...

Solvency games, introduced by Berger et al., provide an abstract framework for modelling decisions of a risk-averse investor, whose goal is to avoid ever going broke. We study a new variant of this model, where, in addition to stochastic environment and fixed increments and decrements to the investor’s wealth, we introduce interest, which is earned or paid on the current level of savings or deb...