Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...