3 resultados para Abstraction decomposition space

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

40.00% 40.00%

Publicador:

Resumo:

* This paper was supported in part by the Bulgarian Ministry of Education, Science and Technologies under contract MM-506/95.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 94A12, 94A20, 30D20, 41A05.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A hard combinatorial problem is investigated which has useful application in design of discrete devices: the two-block decomposition of a partial Boolean function. The key task is regarded: finding such a weak partition on the set of arguments, at which the considered function can be decomposed. Solving that task is essentially speeded up by the way of preliminary discovering traces of the sought-for partition. Efficient combinatorial operations are used by that, based on parallel execution of operations above adjacent units in the Boolean space.