On the k partition dimension of graphs
Texto completo
Figure
Documento similar
Altogether, the results presented in this Thesis on the regulation of the expression and the pathological role of the splicing variants sst5TMD4 and In1-ghrelin in the context of
In the previous sections we have shown how astronomical alignments and solar hierophanies – with a common interest in the solstices − were substantiated in the
Two cases are considered, the one for which the symplectic form on the torus is of integer cohomology class n (section 4.1), where full modular invariance is obtained only when the
Imposing various computability and complexity constraints on these gales produces a spectrum of effective versions of Hausdorff dimen- sion, including constructive,
We develop the basic properties of effective strong dimensions and prove a number of results relating them to fundamental aspects of randomness, Kolmogorov complexity,
Section 5 describes results on Lempel-Ziv compres- sion in terms of results on dimension of complexity classes and vice versa (in particular the one-bit catastrophe in the
The hash algorithm can, as shown in this section, be used for canonicalizing graphs, by using the partial hashes it computes for each statement and variable in the graph:.. • If
Additional information on the subject (calendar, timetable, problem sets, lecture notes,...) appears in the web page of the subject (in University of Zaragoza