Powers of 2 and some of their k-digit structures.

A useful living link list for patent applications.

In the last post, we described a naive algorithm to determine independent sets and got a terrible complexity. Now, we want to grab this algorithm to use it as a base for an alternative way of independent set generation.

A mathematical forced decentralized network protocol needs a set of basic conditions which has to be considered. To get more clear about it, we discuss the differences of this concept regarding to classical decentralized systems and give a first starting point for further design steps.

Today, we want to determine indpendent sets of an arbitrary undirected graph. Which can be done by a trivial ad hoc method, described as follows...