Fully normal algorithms for incomplete hypercubes

The paper shows that composite and incomplete hypercubes are algorithmically equivalent. It develops a class of algorithms called fully normal algorithms for incomplete hypercubes with applications in several important fields. Finally it shows that incomplete hypercubes achieve close to linear speedup for FNA over a wide range of the size of the architecture.<
>