We propose an algorithm for the inference of decision graphs from a set of labeled instances. In particular, we propose to infer decision graphs where the variables can only be tested in accordance with a given order and no redundant nodes exist. This type of graphs, reduced ordered decision graphs, can be used as canonical representations of Boolean functions and can be manipulated using algor...

This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetric accusation function as improved by B. Skoric et al. The length estimation is based on two pillars. First, we consider the Worst Case Attack that a group of c colluders can lead. This attack minimizes the mutual information be...

Let cS(d) denote the minimal composition length of all finite solvable groups with solvable (or derived) length d. We prove that:

In this work, we consider the implications of a phenomenological model quantum gravitational effects related to minimal length, implemented via generalized uncertainty principle. Such are applied Bekenstein–Hawking entropy derive modified law gravity through Verlinde’s conjecture. Implications on galactic scales, and in particular shape rotational curves, investigated, exploring possibility mim...